✦ LIBER ✦

Remarks on distance-regular graphs

✍ Scribed by Mitsuo Yoshizawa

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 157 KB
Volume: 34
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90027-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On Distance-Regular Graphs with ki = kj

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

Spin Models on Bipartite Distance-Regula

Spin Models on Bipartite Distance-Regular Graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Spin models were introduced by V. Jones (Pac. J. Math. 137 (1989), 311-336) to construct invariants of knots and links. A spin model will be defined as a pair \(S=(X, w)\) of a finite set \(X\) and a function \(w\) on \(X \times X\) satisfying several axioms. Some important spin models can be constr

On distance regular graphs with ci=b1

✍ E.W. Lambeck 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Lambeck, E-W., On distance regular graphs with c, = b,, Discrete Mathematics I 13 (1993)

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, III

✍ Akira Hiraki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Let ⌫ be a distance-regular graph with l (1 , a 1 , b 1 ) ϭ 1 and c s ϩ 1 ϭ 1 for some positive integer s . We show the existence of a certain distance-regular graph of diameter s , containing given two vertices at distance s , as a subgraph in ⌫ .

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, IV

✍ Akira Hiraki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Let ⌫ be a distance-regular graph with a 1 Ͼ 0 , r ϭ max ͕ j 3 ( c j , a j , b j ) ϭ ( c 1 , a 1 , b 1 ) ͖ у 2 and a i ϭ a 1 c i , for 1 р i р 2 r . Take any u and in ⌫ at distance r ϩ 1 . We show that there exists a collinearity graph of a generalized 2( r ϩ 1)-gon of order ( a 1 ϩ 1 , c r ϩ 1 Ϫ 1)