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: | , |
|---|---|
| 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 |
| Summary: | 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 after removing the edges of a disjoint family of complete subgraphs. This paper investigates the dimension of the join of two trees, a tree and a cycle, or two cycles. |
|---|