𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance-regular Graphs with b2=1 and Antipodal Covers

✍ Scribed by Makoto Araya; Akira Hiraki; Aleksandar Jurisić

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
234 KB
Volume
18
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

We show that a distance-regular graph of valency k Ͼ 2 is antipodal , if b 2 ϭ 1 . This answers Problem (i) on p . 182 of Brouwer , Cohen and Neumaier [4] .

📜 SIMILAR VOLUMES

Distance-Regular Graphs withbt=1 and Ant
Distance-Regular Graphs withbt=1 and Antipodal Double-Covers
✍ Makoto Araya; Akira Hiraki; Aleksandar Jurišić 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Let 1 be a distance-regular graph of diameter d and valency k>2. If b t =1 and 2t d, then 1 is an antipodal double-cover. Consequently, if f >2 is the multiplicity of an eigenvalue of the adjacency matrix of 1 and if 1 is not an antipodal doublecover then d 2f&3. This result is an improvement of God

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

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

Antipodal distance-regular graphs of dia
Antipodal distance-regular graphs of diameter four and five
✍ Tilla Schade 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB 👁 2 views

An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.

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