𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance degree regular graphs

✍ Scribed by Teluhiko Hilano; Kazumasa Nomura

Book ID
107884208
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
175 KB
Volume
37
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Tight Distance-Regular Graphs
Tight Distance-Regular Graphs
✍ Aleksandar JuriΕ‘iΔ‡; Jack Koolen; Paul Terwilliger πŸ“‚ Article πŸ“… 2000 πŸ› Springer 🌐 English βš– 388 KB
Two distance-regular graphs
Two distance-regular graphs
✍ Andries E. Brouwer, Dmitrii V. Pasechnik πŸ“‚ Article πŸ“… 2011 πŸ› Springer 🌐 English βš– 321 KB
Edge-distance-regular graphs
Edge-distance-regular graphs
✍ M. CΓ‘mara; C. DalfΓ³; J. FΓ brega; M.A. Fiol; E. Garriga πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 189 KB
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