|
On a vertex-symmetric graph with intersection array {205, 136, 1; 1, 68, 205}
A. M. Kagazezheva Kabardino-Balkar State University, Faculty of Mathematics
Abstract:
A. Makhnev and D. Paduchikh found intersection arrays of distance-regular graphs that are locally strongly regular with the second eigenvalue 3. A. Makhnev and M. Samoilenko added to this list the intersection arrays {196, 76, 1; 1, 19, 196} and {205, 136, 1; 1, 68, 205}. However, graphs with these intersection arrays cannot be locally strongly regular. The existence of graphs with these intersection arrays is unknown. We find possible orders and fixed-point subgraphs for the elements of the automorphism group of a distance-regular graph with intersection array {205, 136, 1; 1, 68, 205}. It is proved that a vertex-transitive distance-regular graph with this intersection array is a Cayley graph.
Keywords:
distance-regular graph, automorphism.
Received: 21.05.2018
Citation:
A. M. Kagazezheva, “On a vertex-symmetric graph with intersection array {205, 136, 1; 1, 68, 205}”, Trudy Inst. Mat. i Mekh. UrO RAN, 24, no. 3, 2018, 91–97
Linking options:
https://www.mathnet.ru/eng/timm1554 https://www.mathnet.ru/eng/timm/v24/i3/p91
|
|