Locally s-distance transitive graphs
From MaRDI portal
Publication:3113288
Abstract: We give a unified approach to analysing, for each positive integer , a class of finite connected graphs that contains all the distance transitive graphs as well as the locally -arc transitive graphs of diameter at least . A graph is in the class if it is connected and if, for each vertex , the subgroup of automorphisms fixing acts transitively on the set of vertices at distance from , for each from 1 to . 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 , 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1379442 (Why is no real title available?)
- scientific article; zbMATH DE number 3895117 (Why is no real title available?)
- A family of quasiprimitive 2-arc transitive graphs which have non-quasiprimitive full automorphism groups
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- An infinite family of biquasiprimitive 2-arc transitive cubic graphs
- Analysing finite locally 𝑠-arc transitive graphs
- Automorphism groups of primitive distance-bitransitive graphs are almost simple
- Distance Transitive Graphs and Finite Simple Groups
- Distance biregular bipartite graphs
- Distance-regular graphs and halved graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Distance-transitive graphs and generalized polygons
- Erratum: On imprimitive rank 3 permutation groups.
- Finite normal edge-transitive Cayley graphs
- Finite transitive permutation groups and bipartite vertex-transitive graphs
- Half-transitive graphs of valency 4 with prescribed attachment numbers
- Imprimitive distance-transitive graphs with primitive core of diameter at least 3
- Intersection matrices for finite permutation groups
- Locally \(s\)-distance transitive graphs and pairwise transitive designs
- PRIMITIVE AND IMPRIMITIVE GRAPHS
- Smith's theorem and a characterization of the 6-cube as distance-transitive graph
- Symmetry properties of subdivision graphs
- Tetravalent graphs admitting half-transitive group actions: Alternating cycles
- The nonexistence of 8-transitive graphs
- Vertex-transitive graphs of valency 3
- Vertex-transitive graphs: Symmetric graphs of prime valency
Cited in
(26)- Two-arc-transitive bicirculants
- Analysing finite locally 𝑠-arc transitive graphs
- Locally \(s\)-distance transitive graphs and pairwise transitive designs
- Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
- Two-geodesic transitive graphs of order \(p^n\) with \(n \leq 3\)
- 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
- scientific article; zbMATH DE number 4077280 (Why is no real title available?)
- Two-distance transitive normal Cayley graphs
- On 2-distance primitive graphs of prime valency
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)