Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\)

DOI10.1134/S1064562413010043zbMath1273.05055MaRDI QIDQ352231

Ludmila Yur'evna Tsiovkina, Aleksandr Alekseevich Makhnev, Dmitriĭ Viktorovich Paduchikh

Publication date: 4 July 2013

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Edge-symmetric distance-regular covers of cliques: affine case, Automorphisms of graph with intersection array \(\{64,42,1;1,21,64\}\), On almost distance-transitive graphs, Edge-symmetric distance-regular coverings of cliques: the affine case, AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}, Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• Distance regular covers of the complete graph
• Antipodal distance transitive covers of complete graphs
• Minimal permutation representations of finite simple classical groups. Special linear, symplectic, and unitary groups
• On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)
• On the automorphism group of the Aschbacher graph