𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance matrices, dimension, and conference graphs

✍ Scribed by A. Neumaier


Book ID
108046950
Publisher
Elsevier Science
Year
1981
Weight
377 KB
Volume
84
Category
Article
ISSN
1385-7258

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Distances between the graphs of matrices
✍ Roger A. Horn; Chi-Kwong Li; Dennis I. Merino πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 605 KB
Good distance graphs and the geometry of
✍ Li-Ping Huang πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 234 KB

Denote by G = (V, ∼) a graph which V is the vertex set and ∼ is an adjacency relation on a subset of V Γ— V . In this paper, the good distance graph is defined. Let (V, ∼) and (V , ∼ ) be two good distance graphs, and Ο• : V β†’ V be a map. The following theorem is proved: Ο• is a graph isomorphism ⇔ Ο• i

A note on distance matrices with unicycl
✍ J.M.S SimΓ΅es-Pereira πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 643 KB

We give necessary and sufficient conditions for a distance matrix to have a unicycfic graph as unique optimal graph realization.