Two-distance-primitive graphs with prime valency
From MaRDI portal
Publication:2009598
Recommendations
Cites work
- Antipodal distance transitive covers of complete graphs
- Bounding the diameter of distance. Regular graphs
- Finite 2-distance transitive graphs
- Finite 2-Geodesic Transitive Graphs of Prime Valency
- Finite locally primitive abelian Cayley graphs
- Finite locally-quasiprimitive graphs
- Finite Permutation Groups and Finite Simple Groups
- scientific article; zbMATH DE number 3156420 (Why is no real title available?)
- scientific article; zbMATH DE number 3758571 (Why is no real title available?)
- scientific article; zbMATH DE number 3760197 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Intersection matrices for finite permutation groups
- Local 2-geodesic transitivity and clique graphs
- Locally s-distance transitive graphs
- On 2-arc transitive graphs of girth 4
- On Primitive Permutation Groups with a Doubly Transitive Suborbit
- Subgroups of prime power index in a simple group
- Two-graphs and doubly transitive groups
- Vertex-transitive graphs: Symmetric graphs of prime valency
Cited in
(9)- Imprimitive distance-transitive graphs with primitive core of diameter at least 3
- Two-distance-primitive graphs
- Finite 2-geodesic-transitive graphs of valency twice a prime
- Bipartite distance-transitive doubles with primitive halved of diameter two
- Finite prime distance graphs and 2-odd graphs
- Two-distance transitive normal Cayley graphs
- On finite 2-distance-primitive graphs
- On 2-distance primitive graphs of prime valency
- A characterisation of edge-affine 2-arc-transitive covers of \(\mathcal{K}_{2^n, 2^n}\)
This page was built for publication: Two-distance-primitive graphs with prime valency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009598)