6-transitive graphs

DOI10.1016/0095-8956(80)90063-5zbMath0451.05038OpenAlexW2025458971WikidataQ56001783 ScholiaQ56001783MaRDI QIDQ1147720

Peter J. Cameron

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90063-5

zbMATH Keywords

transitive graphscomplete bipartitecomplete multipartite

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (22)

A classification of finite homogeneous semilinear spaces ⋮ Affine cones over cubic surfaces are flexible in codimension one ⋮ From the Coxeter Graph to the Klein Graph ⋮ On the Combinatorial Power of the Weisfeiler-Lehman Algorithm ⋮ \(>k\)-homogeneous infinite graphs ⋮ A hierarchy of dismantlings in graphs ⋮ On regular graphs equienergetic with their complements ⋮ Locally finite homogeneous graphs ⋮ Generalized Paley graphs equienergetic with their complements ⋮ Quantifier-eliminable locally finite graphs ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Distanced graphs ⋮ An optimal lower bound on the number of variables for graph identification ⋮ d-homogeneous and d-ultrahomogeneous linear spaces ⋮ On recognizing graphs by numbers of homomorphisms ⋮ On \(k\)-connected-homogeneous graphs ⋮ Unnamed Item ⋮ On highly regular strongly regular graphs ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ Metrically homogeneous graphs of diameter 3 ⋮ A census of infinite distance-transitive graphs ⋮ Rank three permutation groups with rank three subconstituents

Cites Work

• On rank 3 permutation groups
• Homogeneous graphs
• Spherical codes and designs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Triple Transitive Graphs
• The Graph Extension Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 6-transitive graphs