Automorphisms of coverings of strongly regular graphs with parameters (81,20,1,6) (Q736201)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automorphisms of coverings of strongly regular graphs with parameters (81,20,1,6) |
scientific article |
Statements
Automorphisms of coverings of strongly regular graphs with parameters (81,20,1,6) (English)
0 references
27 October 2009
0 references
A strongly-regular graph is a distance-regular graph of diameter 2; its parameters \((v,k,\lambda,\mu)\) denote, respectively, the number of vertices, the (constant) valence, the number of common neighbors of any pair of adjacent vertices, and the number of common neighbors of any pair of nonadjacent vertices. In this paper the authors study the automorphisms of distance-regular graphs \(\Gamma\) that can be \(r\)-coverings of the (unique) strongly regular graph with parameters \((81,20,1,6)\). The diameter of \(\Gamma\) may be 4 or 5, and very detailed theorems are presented in three cases of diameter 4, concluding with the following corollary. Let \(\Gamma\) be a distance-regular graph of diameter 4 that is an \(r\)-covering of the strongly-regular graph with parameters \((81,20,1,6)\), where \(r\in\{2,3,6\}\). If \(\Gamma\) is vertex-transitive, then \(r=3\).
0 references
distance-regular graph
0 references
strongly-regular graph
0 references
distance-transitive
0 references
intersection array
0 references
adjacency matrix
0 references
graph covering
0 references
automorphism group
0 references
character of a finite group
0 references
clique
0 references
coclique
0 references
Sylow subgroup
0 references