PRIMITIVE AND IMPRIMITIVE GRAPHS

DOI10.1093/QMATH/22.4.551zbMATH Open0222.05111OpenAlexW2043220195WikidataQ29028405 ScholiaQ29028405MaRDI QIDQ5626697FDOQ5626697

Authors:

Publication date: 1971

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/22.4.551

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cited In (43)

• On the spectral gap and the automorphism group of distance-regular graphs
• Analysing finite locally 𝑠-arc transitive graphs
• The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues
• Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
• Distance-transitive representations of the sporadic groups
• Finite primitive distance-transitive graphs
• Double covers of graphs
• Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
• Graphs related to Held's simple group
• Distance-transitive representations of the symmetric groups
• Quotients of incidence geometries
• A census of infinite distance-transitive graphs
• Antipodal covers of distance-transitive generalized polygons
• Distance-transitive graphs of valency 5, 6 and 7
• Свойства графов орбиталов надгрупп группы Джевонса
• Some degree and distance-based invariants of wreath products of graphs
• Smith's theorem and a characterization of the 6-cube as distance-transitive graph
• Factorizations of primitive permutation groups
• Automorphisms of graphs and coverings
• Remarks on distance-regular graphs
• Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs
• Distance transitive graphs with symmetric or alternating automorphism group
• Basic coset geometries
• Nearly perfect codes in distance-regular graphs
• On bipartite tetra0alent graphs
• Locally \(s\)-distance transitive graphs
• On top locally-\(s\)-distance-transitive graphs
• Automorphism groups of primitive distance-bitransitive graphs are almost simple
• An improved version of Lloyd's theorem
• Non rank 3 strongly regular graphs with the 5-vertex condition
• Classification of distance-transitive orbital graphs of overgroups of the Jevons group
• Distance-transitive graphs admit semiregular automorphisms
• Distance-transitive graphs and generalized polygons
• On the metric dimension of imprimitive distance-regular graphs
• Bipartite distance-transitive doubles with primitive halved of diameter two
• Antipodal distance-transitive covers with primitive quotient of diameter two
• Bounding the diameter of a distance-transitive graph
• There are only finitely many finite distance-transitive graphs of given valency greater than two
• Second neighbourhoods of strongly regular graphs
• Imprimitive distance-regular graphs and projective planes
• Antipodal covering graphs
• Imprimitive distance-transitive graphs with primitive core of diameter at least 3
• An alternative way to generalize the pentagon

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)