𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Imprimitive distance-regular graphs and projective planes

✍ Scribed by A Gardiner

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
426 KB
Volume
16
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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