Terwilliger graphs with μ ≤ 3

Article Properties
Cite
Gavrilyuk, A. L., and A. A. Makhnev. “Terwilliger Graphs With μ ≤ 3”. Mathematical Notes, vol. 82, no. 1-2, 2007, pp. 13-24, https://doi.org/10.1134/s0001434607070036.
Gavrilyuk, A. L., & Makhnev, A. A. (2007). Terwilliger graphs with μ ≤ 3. Mathematical Notes, 82(1-2), 13-24. https://doi.org/10.1134/s0001434607070036
Gavrilyuk, A. L., and A. A. Makhnev. “Terwilliger Graphs With μ ≤ 3”. Mathematical Notes 82, no. 1-2 (2007): 13-24. https://doi.org/10.1134/s0001434607070036.
Gavrilyuk AL, Makhnev AA. Terwilliger graphs with μ ≤ 3. Mathematical Notes. 2007;82(1-2):13-24.
Journal Category
Science
Mathematics
Refrences
Title Journal Journal Categories Citations Publication Date
О графах без корон с регулярными $\mu$-подграфами, II Matematicheskie Zametki 7 2003
A generalization of Moore graphs of diameter two Journal of Combinatorial Theory, Series B
  • Science: Mathematics
 19 1971
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)]. 1996
Ergebnisse der Mathematik und ihrer Grenzgebiete (3) 1989
The Fibonacci Numbers 1963
Refrences Analysis
It primarily includes studies from Matematicheskie Zametki The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year