✦ LIBER ✦

Distance regular graphs of diameter 3 and strongly regular graphs

✍ Scribed by A.E Brouwer

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 124 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90157-2

No coin nor oath required. For personal study only.

✦ Synopsis

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 other. We note some relations with strongly regular graphs and generalized quadrangles.

📜 SIMILAR VOLUMES

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.

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

On regular and strongly-regular self-com

On regular and strongly-regular self-complementary graphs

✍ S.B. Rao 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 589 KB

In this paper we solve 3 of the 6 problems of A. Kotzig on regular and strongly-regular self-complementary graphs, mentioned in "Graph Theory and Related Topics" edited by J.A.

Nonexistence of some Antipodal Distance-

Nonexistence of some Antipodal Distance-regular Graphs of Diameter Four

✍ Aleksandar Jurišić; Jack Koolen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 160 KB

We find an inequality involving the eigenvalues of a regular graph; equality holds if and only if the graph is strongly regular. We apply this inequality to the first subconstituents of a distance-regular graph and obtain a simple proof of the fundamental bound for distance-regular graphs, discovere

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