On almost distance-transitive graphs

DOI10.1134/S1064562413050293zbMath1280.05033MaRDI QIDQ393869

Wen-Bin Guo, Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev

Publication date: 24 January 2014

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

zbMATH Keywords

undirected graphstwice transitive permutation groups

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 (1)

Edge-symmetric distance-regular coverings of complete graphs: the almost simple case

Cites Work

• Unnamed Item
• Edge-symmetric distance-regular covers of cliques with \(\lambda=\mu\)
• Geodesic graphs with homogeneity conditions
• Covers of graphs and EGQs
• Antipodal distance transitive covers of complete graphs
• Edge-symmetric distance-regular covers of cliques: affine case

This page was built for publication: On almost distance-transitive graphs