The dimension of the join of two graphs

Added Title

A graph is of dimension n if it can be drawn in the n-dimensional Euclidean space Rⁿ such that the edges are straight line segments of one unit long, but not in some Euclidean 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.

Authors

Severino V. Gervacio, De La Salle University, Manila
Isagani B. Jos, De La Salle University, Manila

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Conference Proceeding

Source Title

Proceedings of the Seventh OU-DLSU Academic Research Workshop

Publication Date

2005

Abstract

A graph is of dimension n if it can be drawn in then-dimensional Euclidian space Rⁿ 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.

html

Recommended Citation

Gervacio, S. V., & Jos, I. B. (2005). The dimension of the join of two graphs. Proceedings of the Seventh OU-DLSU Academic Research Workshop Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/7301

Disciplines

Mathematics

Note

Publication/creation date supplied

Keywords

Trees (Graph theory)

Upload File

wf_no