✦ LIBER ✦

Distance-regular graphs with girth 3 or 4: I

✍ Scribed by Paul Terwilliger

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 913 KB
Volume: 39
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90054-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Valency of Distance-regular Antipodal Gr

Valency of Distance-regular Antipodal Graphs with Diameter 4

✍ Štefko Miklavič 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for

Distance-regular graphs with Γ(x)≃3∗Ka+1

✍ Norio Yamazaki 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 581 KB

A remark on the intersection arrays of d

A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameterd= 3i− 1 withbi= 1 andk> 2

✍ E. W. Lambeck 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 250 KB

Let [' be a distance regular graph with intersection array {bo, bl, . •., bd\_l; ct, ..., ed}. It is shown that in same cases (c i 1, ai-I, br I) = (ct, at, bt) and (c2~ t, a2~ 1, b2i l) = (ci, a~, bi) imply k <\_ 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i -1 with b I =

There Exists no Distance-regular Graph w

There Exists no Distance-regular Graph with Intersection Array (5,4,3; 1,1,2)

✍ D.G. Fon-Der-Flaass 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 83 KB

On a Conjecture of Bannai and Ito: There

On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7

✍ J.H. Koolen; V. Moulton 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai-Ito conject

Triangulations of 3-way regular triparti

Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares

✍ L.D. Andersen; A.J.W. Hilton 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 831 KB

If G is a regular tripartite graph of degree d(G) with tripartition (A,B,C) of V(G) such that the bipartite subgraphs induced by each ofA UB, BU C, CUA are all regular of degree ½d(G), then we call G 3-way regular. We give necessary and sufficient conditions for a 3-way regular tripartite graph of d