✦ LIBER ✦

Distance-regular graphs and (s, c, a, k)-graphs

✍ Scribed by Paul Terwilliger

Book ID: 103506061
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 546 KB
Volume: 34
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90015-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-distance-regular graphs are distanc

Edge-distance-regular graphs are distance-regular

✍ Cámara, M.; Dalfó, C.; Delorme, C.; Fiol, M.A.; Suzuki, H. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 235 KB

From regular boundary graphs to antipoda

From regular boundary graphs to antipodal distance-regular graphs

✍ Fiol, M. A.; Garriga, E.; Yebra, J. L. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

Let Γ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (λ) > n -1, then D ≤ d -1, where P is the polynomial of degree d-1 which takes alternating values ±1 at λ 1 , . . . , λ d . The graphs satisfying P (λ) = n -1, called boundary graphs, h

Edge-distance-regular graphs

✍ M. Cámara; C. Dalfó; J. Fàbrega; M.A. Fiol; E. Garriga 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Cubic Distance-Regular Graphs

✍ Biggs, N. L.; Boshier, A. G.; Shawe-Taylor, J. 📂 Article 📅 1986 🏛 Oxford University Press 🌐 English ⚖ 211 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

Resistance distance in regular graphs

✍ I. Lukovits; S. Nikolić; N. Trinajstić 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 2 views

This report considers the resistance distance as a recently proposed new ## Ž . intrinsic metric on molecular graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been vertices and K denotes a complete graph contai