𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Eigenvalues, diameter, and mean distance in graphs

✍ Scribed by Bojan Mohar

Publisher
Springer Japan
Year
1991
Tongue
English
Weight
608 KB
Volume
7
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Connectivity and diameter in distance gr
Connectivity and diameter in distance graphs
✍ Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 111 KB
Bounding the diameter and the mean dista
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
✍ J.A. RodrΓ­guez; J.L.A. Yebra πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 527 KB

Recently, several results bounding above the diameter and/or the mean distance of a graph from its eigenvalues have been presented. They use the eigenvalues of either the adjacency or the Laplacian matrix of the graph. The main object of this paper is to compare both methods. As expected, they are e

Distances and diameters on iterated cliq
Distances and diameters on iterated clique graphs
✍ Miguel A. PizaΓ±a πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 203 KB

If G is a graph, its clique graph, K(G), is the intersection graph of all its (maximal) cliques. Iterated clique graphs are then deΓΏned recursively by: K We study the relationship between distances in G and distances in K n (G). Then we apply these results to Johnson graphs to give a shorter and si

Distance regular graphs of diameter 3 an
Distance regular graphs of diameter 3 and strongly regular graphs
✍ A.E Brouwer πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the