Currie, J.D., Connectivity of distance graphs, Discrete Mathematics 103 (1992) 91-94. The author shows the following: Let K 2 Q be a H-module. Let G be a graph with vertex set V, a K-space. Suppose that edges of G are preserved under translations in V. Then if G has more than one connected componen
β¦ LIBER β¦
On the connectivity of unit distance graphs
β Scribed by Michael Reid
- Book ID
- 105329625
- Publisher
- Springer Japan
- Year
- 1996
- Tongue
- English
- Weight
- 587 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Connectivity of distance graphs
β
J.D. Currie
π
Article
π
1992
π
Elsevier Science
π
English
β 243 KB
On the distance connectivity of graphs a
β
M.A. Fiol; J. FΓ brega
π
Article
π
1994
π
Elsevier Science
π
English
β 475 KB
Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be
Unit-distance graphs, graphs on the inte
β
Kiran B. Chilakamarri; Carolyn R. Mahoney
π
Article
π
1996
π
Springer
π
English
β 952 KB
Unit-distance graphs, graphs on the inte
β
Kiran B. Chilakamarri; Carolyn R. Mahoney
π
Article
π
1995
π
Springer
π
English
β 57 KB
On connected domination in unit ball gra
β
Sergiy Butenko; Sera Kahruman-Anderoglu; Oleksii Ursulenko
π
Article
π
2010
π
Springer-Verlag
π
English
β 169 KB
On the connectivity of total graphs
β
Takashi Hamada; Toshio Nonaka; Izumi Yoshimura
π
Article
π
1972
π
Springer
π
English
β 360 KB