Asymptotic Delsarte cliques in distance-regular graphs
- 20 June 2015
- journal article
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 43 (4) , 771-782
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Faster Canonical Forms for Primitive Coherent Configurations2015
- Faster Canonical Forms for Strongly Regular Graphs2013
- On distance-regular graphs with smallest eigenvalue at least −mJournal of Combinatorial Theory, Series B, 2010
- On a Characterization of Bilinear Forms GraphsEuropean Journal of Combinatorics, 1999
- Faster isomorphism testing of strongly regular graphs1996
- Improvement of Bruck's completion theoremDesigns, Codes and Cryptography, 1991
- Distance-Regular Graphs1989
- A remark on partial linear spaces of girth 5 with an application to strongly regular graphsCombinatorica, 1988
- On the Complexity of Canonical Labeling of Strongly Regular GraphsSIAM Journal on Computing, 1980
- Strongly regular graphs with smallest eigenvalue ?mArchiv der Mathematik, 1979