Finite 2-distance transitive graphs

From MaRDI portal
Publication:5360876

DOI10.1002/JGT.22112zbMATH Open1370.05052arXiv1507.01027OpenAlexW2963418984MaRDI QIDQ5360876FDOQ5360876


Authors: Brian P. Corr, Wei Jin, Csaba Schneider Edit this on Wikidata


Publication date: 26 September 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: A non-complete graph Gamma is said to be (G,2)-distance transitive if G is a subgroup of the automorphism group of Gamma that is transitive on the vertex set of Gamma, and for any vertex u of Gamma, the stabilizer Gu is transitive on the sets of vertices at distance 1 and 2 from u. This paper investigates the family of (G,2)-distance transitive graphs that are not (G,2)-arc transitive. Our main result is the classification of such graphs of valency not greater than 5.


Full work available at URL: https://arxiv.org/abs/1507.01027




Recommendations





Cited In (12)





This page was built for publication: Finite 2-distance transitive graphs

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