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. |
---|---|
格式: | text |
出版: |
Animo Repository
2005
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/7301 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Solvable join of graphs
由: Gervacio, Severino V., et al.
出版: (2006) -
Subdivision number of large complete graphs and large complete multipartite graphs
由: Gervacio, Severino V.
出版: (2005) -
On biconnected graphs
由: Gonzaga, Alex C.
出版: (1995) -
Resistance distance in complete n-partite graphs
由: Gervacio, Severino V.
出版: (2016) -
On the fold thickness of graphs
由: Campeña, Francis Joseph H., et al.
出版: (2020)