|
This article is cited in 5 scientific papers (total in 6 papers)
Terwilliger Graphs with $\mu\le3$
A. L. Gavrilyuk, A. A. Makhnev Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Abstract:
A Terwilliger graph is a noncomplete graph in which intersection of the neighborhoods of any two vertices at distance 2 from each other is a $\mu$-clique. We classify connected Terwilliger graphs with $\mu=3$ and describe the structure of Terwilliger graphs of diameter 2 with $\mu=2$.
Keywords:
undirected graph, regular graph, biregular graph, Terwilliger graph, edge regular graph, clique extension, Fibonacci number, affine and projective plane.
Received: 22.05.2006
Citation:
A. L. Gavrilyuk, A. A. Makhnev, “Terwilliger Graphs with $\mu\le3$”, Mat. Zametki, 82:1 (2007), 14–26; Math. Notes, 82:1 (2007), 13–24
Linking options:
https://www.mathnet.ru/eng/mzm3749https://doi.org/10.4213/mzm3749 https://www.mathnet.ru/eng/mzm/v82/i1/p14
|
Statistics & downloads: |
Abstract page: | 470 | Full-text PDF : | 196 | References: | 52 | First page: | 4 |
|