The dimension of the join of two graphs
A graph is of dimension n if it can be drawn in then-dimensional Euclidian space Rn such that the edges are straight line segments of one unit long, but not in some Eucliclean space of lower dimension. A study has been made by Maehara on the dimension of the graph obtained from a complete graph afte...
Saved in:
Main Authors: | Gervacio, Severino V., Jos, Isagani B. |
---|---|
Format: | text |
Published: |
Animo Repository
2005
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7301 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
Solvable join of graphs
by: Gervacio, Severino V., et al.
Published: (2006) -
Subdivision number of large complete graphs and large complete multipartite graphs
by: Gervacio, Severino V.
Published: (2005) -
On biconnected graphs
by: Gonzaga, Alex C.
Published: (1995) -
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
Resistance distance in complete n-partite graphs
by: Gervacio, Severino V.
Published: (2016)