Distance-regularised graphs are distance-regular or distance-biregular
- 1 August 1987
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 43 (1) , 14-24
- https://doi.org/10.1016/0095-8956(87)90027-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Automorphism Groups of Primitive Distance-Bitransitive Graphs are Almost SimpleEuropean Journal of Combinatorics, 1987
- Distance-biregular graphs with 2-valent vertices and distance-regular line graphsJournal of Combinatorial Theory, Series B, 1985
- Generalized n-gons and Chebychev polynomialsJournal of Combinatorial Theory, Series A, 1983
- Spectral conditions for the reconstructibility of a graphJournal of Combinatorial Theory, Series B, 1981