Abstract
It is known that if the minimal eigenvalue of a graph is −2, then the graph satisfies Hoffman’s condition; i.e., for any generated complete bipartite subgraph K 1,3 with parts {p} and {q 1, q 2, q 3}, any vertex distinct from p and adjacent to two vertices from the second part is not adjacent to the third vertex and is adjacent to p. We prove the converse statement, formulated for strongly regular graphs containing a 3-claw and satisfying the condition gm > 1.
Similar content being viewed by others
References
V. V. Kabanov and A. A. Makhnev, Izv. Ural’sk. Gos. Univ. 10, 44 (1998).
V. V. Kabanov, A. A. Makhnev, and D. V. Paduchikh, Mat. Zametki 74, 396 (2003).
A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs (Springer-Verlag, Berlin, 1989).
A. E. Brouwer and J. H. van Lint, in Enumeration and Design, Ed. by D. M. Jackson and S. A. Vanstone (Academic, New York, 1984), pp. 85–122.
L. C. Chang, Sci. Record 3, 604 (1949).
L. C. Chang, Sci. Record 4, 12 (1950).
M. D. Hestenes and D. G. Higman, SIAM-AMS Proc. 4, 141 (1971).
A. J. Hoffman, Ann. Math. Statist. 31, 492 (1960).
A. J. Hoffman, IBM J. Res. Develop. 4, 487 (1960).
J. J. Seidel, Linear Algebra Appl. 1, 281 (1968).
S. S. Shrikhande, Ann. Math. Statist. 30, 781 (1959).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.V. Kabanov, S.V. Unegov, 2007, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2007, Vol. 13, No. 3.
Rights and permissions
About this article
Cite this article
Kabanov, V.V., Unegov, S.V. Strongly regular graphs with Hoffman’s condition. Proc. Steklov Inst. Math. 261 (Suppl 1), 107–112 (2008). https://doi.org/10.1134/S008154380805009X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S008154380805009X