Locally s-distance transitive graphs

DOI10.1002/JGT.20574zbMATH Open1234.05119arXiv1003.2274OpenAlexW2037621109MaRDI QIDQ3113288FDOQ3113288

Authors: Alice Devillers, Michael Giudici, Cai Heng Li, Cheryl E. Praeger 

Publication date: 8 February 2012

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

Abstract: We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph is in the class if it is connected and if, for each vertex $v$, the subgroup of automorphisms fixing $v$ acts transitively on the set of vertices at distance $i$ from $v$, for each $i$ from 1 to $s$. We prove that this class is closed under forming normal quotients. Several graphs in the class are designated as degenerate, and a nondegenerate graph in the class is called basic if all its nontrivial normal quotients are degenerate. We prove that, for $sgeq2$, a nondegenerate, nonbasic graph in the class is either a complete multipartite graph, or a normal cover of a basic graph. We prove further that, apart from the complete bipartite graphs, each basic graph admits a faithful quasiprimitive action on each of its (1 or 2) vertex orbits, or a biquasiprimitive action. These results invite detailed additional analysis of the basic graphs using the theory of quasiprimitive permutation groups.

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

Recommendations

• Analysing finite locally 𝑠-arc transitive graphs
• Characterizing finite locally s-arc transitive graphs with a star normal quotient
• scientific article; zbMATH DE number 2149411
• On top locally-\(s\)-distance-transitive graphs
• Locally \(s\)-transitive graphs

zbMATH Keywords

\(s\)-arc transitive graphslocally \(s\)-distance transitive graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cites Work

• Distance biregular bipartite graphs
• Distance-regularised graphs are distance-regular or distance-biregular
• Tetravalent graphs admitting half-transitive group actions: Alternating cycles
• Half-transitive graphs of valency 4 with prescribed attachment numbers
• The nonexistence of 8-transitive graphs
• An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
• Analysing finite locally 𝑠-arc transitive graphs
• Finite normal edge-transitive Cayley graphs
• Vertex-transitive graphs: Symmetric graphs of prime valency
• Imprimitive distance-transitive graphs with primitive core of diameter at least 3
• Distance-regular graphs and halved graphs
• Smith's theorem and a characterization of the 6-cube as distance-transitive graph
• Title not available (Why is that?)
• PRIMITIVE AND IMPRIMITIVE GRAPHS
• Finite transitive permutation groups and bipartite vertex-transitive graphs
• Automorphism groups of primitive distance-bitransitive graphs are almost simple
• Distance-transitive graphs and generalized polygons
• Locally \(s\)-distance transitive graphs and pairwise transitive designs
• Intersection matrices for finite permutation groups
• Distance Transitive Graphs and Finite Simple Groups
• An infinite family of biquasiprimitive 2-arc transitive cubic graphs
• Symmetry properties of subdivision graphs
• Vertex-transitive graphs of valency 3
• A family of quasiprimitive 2-arc transitive graphs which have non-quasiprimitive full automorphism groups
• Title not available (Why is that?)
• Erratum: On imprimitive rank 3 permutation groups.

Cited In (26)

• Analysing finite locally 𝑠-arc transitive graphs
• Locally \(s\)-distance transitive graphs and pairwise transitive designs
• Two-geodesic transitive graphs of order \(p^n\) with \(n \leq 3\)
• Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
• Finite two-distance-transitive dihedrants
• Finite 2-geodesic transitive abelian Cayley graphs
• Two-distance-primitive graphs with prime valency
• On geodesic transitive graphs
• Two-geodesic-transitive graphs which are locally self-complementary
• Two-distance-primitive graphs
• Two-geodesic-transitive graphs of odd order
• Transitive graphs uniquely determined by their local structure
• An infinite family of biquasiprimitive 2-arc transitive cubic graphs
• A classification of graphs whose subdivision graph is locally distance transitive
• On 2-distance-transitive circulants
• Finite 4-geodesic-transitive graphs with bounded girth
• On top locally-\(s\)-distance-transitive graphs
• Finite \(s\)-geodesic transitive graphs which are locally disconnected
• On normal 2-geodesic transitive Cayley graphs
• Permutation groups and derangements of odd prime order
• Symmetry properties of subdivision graphs
• Two-geodesic-transitive graphs which are locally connected
• Title not available (Why is that?)
• On 2-distance primitive graphs of prime valency
• Two-distance transitive normal Cayley graphs
• Two-arc-transitive bicirculants

This page was built for publication: Locally \(s\)-distance transitive graphs

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