✦ LIBER ✦

Bounding the diameter of a distance-transitive graph

✍ Scribed by D.H Smith

Book ID: 107884022
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 268 KB
Volume: 16
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90056-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding the diameter of a distance regu

Bounding the diameter of a distance regular graph by a function ofkd

✍ Hiroshi Suzuki 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 557 KB

Bounding the diameter of distance-regula

Bounding the diameter of distance-regular graphs

✍ C. D. Godsil 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 677 KB

A Bound for the Diameter of Distance-Reg

A Bound for the Diameter of Distance-Regular Graphs

✍ L. Pyber 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 138 KB

Bounding the Diameter of a Distance Regu

Bounding the Diameter of a Distance Regular Graph by a Function of kd, II

✍ H. Suzuki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 844 KB

Bounding the size of a vertex-stabiliser

Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph

✍ Cheryl E. Praeger; Pablo Spiga; Gabriel Verret 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 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