|
This article is cited in 1 scientific paper (total in 2 paper)
Automorphisms of Coverings of Strongly Regular Graphs with Parameters (81,20,1,6)
Guo Wenbin, A. A. Makhnev, D. V. Paduchikh Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Abstract:
The possible orders and subgraphs of fixed points of the automorphisms of distance-regular graphs of diameter 4 which are $r$-coverings of a strongly regular graph with parameters (81,20,1,6) for $r\in\{2,3,6\}$ are found. It is proved that, if the automorphism group of a covering of the above type acts transitively on the set of vertices of the graph, then $r=3$.
Keywords:
distance-regular graph, intersection array, adjacency maytix, covering of a graph, automorphism group, character of a finite group, clique, coclique, Sylow subgroup.
Received: 14.05.2008
Citation:
Guo Wenbin, A. A. Makhnev, D. V. Paduchikh, “Automorphisms of Coverings of Strongly Regular Graphs with Parameters (81,20,1,6)”, Mat. Zametki, 86:1 (2009), 22–36; Math. Notes, 86:1 (2009), 26–40
Linking options:
https://www.mathnet.ru/eng/mzm5097https://doi.org/10.4213/mzm5097 https://www.mathnet.ru/eng/mzm/v86/i1/p22
|
Statistics & downloads: |
Abstract page: | 389 | Full-text PDF : | 197 | References: | 53 | First page: | 4 |
|