𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distances and volumina for graphs

✍ Scribed by D.J. Klein; H.‐Y. Zhu

Book ID
118661136
Publisher
Springer
Year
1998
Tongue
English
Weight
210 KB
Volume
23
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian graphs involving distances
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

Boolean distance for graphs
Boolean distance for graphs
✍ Frank Harary; Robert A. Melter; Uri N. Peled; Ioan Tomescu 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 576 KB

The boolear? distance between twc points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (@ if x = y). It is determined in terms of the block-cutpoint graph of G, and shown to satisfy the triangle inequality b(x, y)c\_ b(x, z)U b(z, y). We denote