PRIMITIVE AND IMPRIMITIVE GRAPHS
From MaRDI portal
Publication:5626697
Cited in
(43)- Finite primitive distance-transitive graphs
- Non rank 3 strongly regular graphs with the 5-vertex condition
- Second neighbourhoods of strongly regular graphs
- Distance-transitive representations of the symmetric groups
- An alternative way to generalize the pentagon
- Double covers of graphs
- Quotients of incidence geometries
- Automorphism groups of primitive distance-bitransitive graphs are almost simple
- Analysing finite locally 𝑠-arc transitive graphs
- On bipartite tetra0alent graphs
- Bipartite distance-transitive doubles with primitive halved of diameter two
- A census of infinite distance-transitive graphs
- Classification of distance-transitive orbital graphs of overgroups of the Jevons group
- Properties of graphs of orbitals for overgroups of the Jevons group
- Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
- Distance-transitive graphs admit semiregular automorphisms
- On top locally-\(s\)-distance-transitive graphs
- Antipodal covers of distance-transitive generalized polygons
- Factorizations of primitive permutation groups
- Antipodal distance-transitive covers with primitive quotient of diameter two
- The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues
- Bounding the diameter of a distance-transitive graph
- Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs
- Imprimitive distance-regular graphs and projective planes
- Distance-transitive graphs and generalized polygons
- Automorphisms of graphs and coverings
- Smith's theorem and a characterization of the 6-cube as distance-transitive graph
- Graphs related to Held's simple group
- Remarks on distance-regular graphs
- Distance transitive graphs with symmetric or alternating automorphism group
- Distance-transitive representations of the sporadic groups
- Distance-transitive graphs of valency 5, 6 and 7
- Locally \(s\)-distance transitive graphs
- On the metric dimension of imprimitive distance-regular graphs
- On the spectral gap and the automorphism group of distance-regular graphs
- Antipodal covering graphs
- There are only finitely many finite distance-transitive graphs of given valency greater than two
- An improved version of Lloyd's theorem
- Imprimitive distance-transitive graphs with primitive core of diameter at least 3
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Some degree and distance-based invariants of wreath products of graphs
- Basic coset geometries
- Nearly perfect codes in distance-regular graphs
This page was built for publication: PRIMITIVE AND IMPRIMITIVE GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5626697)