Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050
A Criterion for a Graph to Admit a Tight Substantial Map into the Euclidean n-space
Hirofumi NAGASAKA
著者情報
ジャーナル フリー

2001 年 7 巻 1 号 p. 61-66

詳細
抄録
We give a sufficient and necessary condition for a finite graph to admit a tight and substantial polygonal map into the n-dimensional Euclidean space. As a consequence, we determine the curvature dimension for 2-connected graphs explicitly from their topological structure.
著者関連情報
© 2001 by the Graduate School of Information Sciences (GSIS), Tohoku University

This article is licensed under a Creative Commons [Attribution 4.0 International] license.
https://creativecommons.org/licenses/by/4.0/
前の記事 次の記事
feedback
Top