✦ LIBER ✦

Distances, Graphs and Designs

✍ Scribed by Neumaier, A.

Book ID: 124112661
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 858 KB
Volume: 1
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(80)80050-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distances and volumina for graphs

✍ D.J. Klein; H.‐Y. Zhu 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 210 KB

Locally s-distance transitive graphs and

Locally s-distance transitive graphs and pairwise transitive designs

✍ Devillers, Alice; Giudici, Michael; Li, Cai Heng; Praeger, Cheryl E. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 334 KB

Spectral distances of graphs

✍ Irena Jovanović; Zoran Stanić 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Hamiltonian graphs involving distances

✍ Guantao Chen; R. H. Schelp 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

## Abstract Let __G__ be a graph of order __n__. We show that if __G__ is a 2‐connected graph and max{__d(u), d(v)__} + |__N(u)__ U __N(v)__| ≥ __n__ for each pair of vertices __u, v__ at distance two, then either __G__ is hamiltonian or G 3K~n/3~ U T~1~ U T~2~, where n  O (mod 3), and __T__~1~ a

Distances in Molecular Graphs †

✍ Katouda, Wataru; Kawai, Takashi; Takabatake, Tetsuhiko; Tanaka, Akio; Bersohn, M 📂 Article 📅 2004 🏛 American Chemical Society 🌐 English ⚖ 86 KB

Distances and cuts in planar graphs

✍ A Schrijver 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 570 KB