✦ LIBER ✦

Bounding the diameter of distance-regular graphs

✍ Scribed by C. D. Godsil

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 677 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02189090

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 ofkd

✍ Hiroshi Suzuki 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 557 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

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

D-bounded Distance-regular Graphs

✍ Chih-Wen Weng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Let ⌫ ϭ ( X , R ) denote a distance-regular graph with diameter D у 3 and distance function ␦ . A (vertex) subgraph ⌬ ' X is said to be weak -geodetically closed whenever for all x , y ⌬ and all z X , ⌫ is said to be D -bounded whenever , for all x , y X , x and y are contained in a common regular

Antipodal distance-regular graphs of dia

Antipodal distance-regular graphs of diameter four and five

✍ Tilla Schade 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 2 views

An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.