✦ LIBER ✦

Kite-free distance-regular graphs

✍ Scribed by Paul Terwilliger

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 451 KB
Volume: 16
Category: Article
ISSN: 0195-6698
DOI: 10.1016/0195-6698(95)90020-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallelogram-Free Distance-Regular Grap

Parallelogram-Free Distance-Regular Graphs

✍ Yuh-jeng Liang; Chih-wen Weng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Let 1=(X, R) denote a distance-regular graph with distance function and diameter d 4. By a parallelogram of length i (2 i d), we mean a 4-tuple xyzu of vertices in X such that (x, y)= (z, u)=1, (x, u)=i, and (x, z)= ( y, z)= ( y, u)=i&1. We prove the following theorem. Theorem. Let 1 denote a distan

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

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

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

Three New Distance-regular Graphs

✍ Leonard H. Soicher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Remarks on distance-regular graphs

✍ Mitsuo Yoshizawa 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 157 KB