Abstract
A Terwilliger graph is a noncomplete graph in which the intersection of the neighborhoods of any two vertices at distance 2 from each other is a μ-clique. We classify connected Terwilliger graphs with μ = 3 and describe the structure of Terwilliger graphs of diameter 2 with μ = 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, in Ergebnisse der Mathematik und ihrer Grenzgebiete (3) (Springer-Verlag, Berlin-Heidelberg-New York, 1989), Vol. 18.
A. A. Makhnev, “On regular Terwilliger graphs with μ = 2,” Sibirsk. Mat. Zh. 37 (5), 1132–1134 (1996) [Siberian Math. J. 37 (5), 997–999 (1996)].
V. V. Kabanov, A. A. Makhnev, and D. V. Paduchikh “On graphs without crowns with regular μ-subgraphs. II,” Mat. Zametki 74 (3), 396–406 (2003) [Math. Notes 74 (3–4), 375–384 (2003)].
R. C. Bose and T. A. Dowling, “A generalization of Moore graphs of diameter two,” J. Combin. Theory Ser. B 11 (3), 213–226(1971).
N. N. Vorobyov, The Fibonacci Numbers, D. C. Heath and Co., Boston, Mass. 1963.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gavrilyuk, A.L., Makhnev, A.A. Terwilliger graphs with μ ≤ 3. Math Notes 82, 13–24 (2007). https://doi.org/10.1134/S0001434607070036
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0001434607070036