𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance-regular graphs and (α, β)-geometries

✍ Scribed by Elisabeth Kuijken; Cristina Tonesi

Book ID
105761314
Publisher
Springer
Year
2005
Tongue
English
Weight
103 KB
Volume
82
Category
Article
ISSN
0047-2468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strongly Regular (α, β)-Geometries
Strongly Regular (α, β)-Geometries
✍ Nicholas Hamilton; Rudolf Mathon 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 217 KB

In this paper we introduce strongly regular (:, ;)-geometries. These are a class of geometries that generalise semipartial geometries. Like semipartial geometries the underlying point graph is strongly regular and this is part of the motivation for studying the geometries. In the paper several neces

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
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