Edge-symmetric distance-regular covers of cliques with =

DOI10.1134/S1064562413010043MaRDI QIDQ352231zbMATH OpenFDO

Authors Alexandre A. Makhnev, Dmitriĭ Viktorovich Paduchikh, Ludmila Yur'evna Tsiovkina

Publication date 4 July 2013

Published in Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Edge-symmetric distance-regular covers of cliques: affine case
• Edge-symmetric distance-regular coverings of cliques: the affine case
• Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
• On a class of vertex-transitive distance-regular covers of complete graphs
• Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 1313469 (Why is no real title available?)
• Antipodal distance transitive covers of complete graphs
• Distance regular covers of the complete graph
• 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 automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\)
• On the automorphism group of the Aschbacher graph

Cited in

(7)

• Edge-symmetric distance-regular coverings of cliques: the affine case
• Edge-symmetric distance-regular coverings of complete graphs: the almost simple case
• Automorphisms of graph with intersection array \(\{64,42,1;1,21,64\}\)
• Edge-symmetric distance-regular covers of cliques: affine case
• On almost distance-transitive graphs
• Automorphisms of distance-regular graph with intersection array \(\{25,16,1;1,8,25\}\)
• Arc-transitive distance-regular covers of cliques with \(\lambda = \mu\)

This page was built for publication: Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352231)