|
This article is cited in 4 scientific papers (total in 5 papers)
Automorphisms of Terwilliger graphs with $\mu=2$
A. L. Gavrilyuka, Wenbin Guob, A. A. Makhneva a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
b Department of Math., Xuzhou Normal Univ., Xuzhou, P. R. China
Abstract:
A description is furnished for automorphisms of prime order and subgraphs of their fixed points in distance-regular graphs with intersection arrays $\{50,42,1;1,2,50\}$ and $\{50,42,9;1,2,42\}$. It is proved that these graphs cannot be vertex-transitive.
Keywords:
distance-regular graph, automorphism, vertex-transitive graph.
Received: 23.01.2008
Citation:
A. L. Gavrilyuk, Wenbin Guo, A. A. Makhnev, “Automorphisms of Terwilliger graphs with $\mu=2$”, Algebra Logika, 47:5 (2008), 584–600; Algebra and Logic, 47:5 (2008), 330–339
Linking options:
https://www.mathnet.ru/eng/al377 https://www.mathnet.ru/eng/al/v47/i5/p584
|
Statistics & downloads: |
Abstract page: | 396 | Full-text PDF : | 87 | References: | 61 | First page: | 11 |
|