𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance-Regular Graphs and Halved Graphs

✍ Scribed by Hemmeter, Joe


Book ID
123236379
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
744 KB
Volume
7
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


From regular boundary graphs to antipoda
✍ 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

Distance regular graphs of diameter 3 an
✍ 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

Distance degree regular graphs
✍ Teluhiko Hilano; Kazumasa Nomura πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 175 KB
Tight Distance-Regular Graphs
✍ Aleksandar JuriΕ‘iΔ‡; Jack Koolen; Paul Terwilliger πŸ“‚ Article πŸ“… 2000 πŸ› Springer 🌐 English βš– 388 KB
Two distance-regular graphs
✍ Andries E. Brouwer, Dmitrii V. Pasechnik πŸ“‚ Article πŸ“… 2011 πŸ› Springer 🌐 English βš– 321 KB