Distance regular covers of the complete graph
- 1 November 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 56 (2) , 205-238
- https://doi.org/10.1016/0095-8956(92)90019-t
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Bounding the diameter of distance-regular graphsCombinatorica, 1988
- Distance-regularised graphs are distance-regular or distance-biregularJournal of Combinatorial Theory, Series B, 1987
- Distance regular graphs of diameter 3 and strongly regular graphsDiscrete Mathematics, 1984
- Feasibility conditions for the existence of walk-regular graphsLinear Algebra and its Applications, 1980
- Two infinite classes of perfect codes in metrically regular graphsJournal of Combinatorial Theory, Series B, 1977
- Antipodal covering graphsJournal of Combinatorial Theory, Series B, 1974
- Equiangular linesJournal of Algebra, 1973
- Equi-isoclinic subspaces of Euclidean spacesIndagationes Mathematicae, 1973
- Combinatorial Properties of Group Divisible Incomplete Block DesignsThe Annals of Mathematical Statistics, 1952