✦ LIBER ✦

Distance-regular graphs of hamming type

✍ Scribed by Kazumasa Nomura

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 383 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90071-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On local structure of a distance-regular

On local structure of a distance-regular graph of Hamming type

✍ Kazumasa Nomura 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Classical Distance-Regular Graphs of Neg

Classical Distance-Regular Graphs of Negative Type

✍ Chih-wen Weng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 160 KB

We prove the following theorem. Theorem. Let 1=(X, R) denote a distance-regular graph with classical parameters (d, b, :, ;) and d 4. Suppose b<&1, and suppose the intersection numbers a 1 {0, c 2 >1. Then precisely one of the following (i) (iii) holds. (i) 1 is the dual polar graph 2 A 2d&1 (&b).

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

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

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