On distance-regular graphs with smallest eigenvalue at least −m
Authors:
- 1 November 2010
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 100 (6) , 573-584
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Research Foundation of Korea
- Ministry of Education, Science and Technology (2009-0089826, 2009-0094069, KRF-2008-359-C00002)
This publication has 13 references indexed in Scilit:
- There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valencyJournal für die reine und angewandte Mathematik (Crelles Journal), 2009
- Distance-Regular (0,α)-ReguliDesigns, Codes and Cryptography, 2006
- On a Characterization of Bilinear Forms GraphsEuropean Journal of Combinatorics, 1999
- Two remarks on Huang's characterization of the bilinear forms graphsEuropean Journal of Combinatorics, 1992
- A Characterization of the Association Schemes of Bilinear FormsEuropean Journal of Combinatorics, 1987
- Characterization of H(n, q) by the parametersJournal of Combinatorial Theory, Series A, 1981
- Strongly regular graphs with smallest eigenvalue ?mArchiv der Mathematik, 1979
- Line graphs, root systems, and elliptic geometryJournal of Algebra, 1976
- Nonisomorphic Steiner triple systemsMathematische Zeitschrift, 1974
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963