A root graph that is locally the line graph of the Petersen graph

DOI10.1016/S0012-365X(02)00546-0MaRDI QIDQ1869239zbMATH OpenFDO

Authors Andries E. Brouwer, Jack H. Koolen, Mikhail H. Klin

Publication date 9 April 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(02)00546-0

zbMATH Keywords

distance-regular graphlocal characterizationstrongly regular graphsymmetric design

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• scientific article; zbMATH DE number 3966130
• Local structure of graphs with \(\lambda= \mu= 2\), \(a_ 2=4\)
• scientific article; zbMATH DE number 6808067
• Locally \(K_{3,3}\) or Petersen graphs
• scientific article; zbMATH DE number 3887729

Cited in

(14)

• Flag-transitive symmetric 2-(96,20,4)-designs
• Strongly regular configurations
• Arc-transitive groups of automorphisms of antipodal distance-regular graphs of diameter 3 in affine case
• Recent progress in algebraic design theory
• Construction of strongly regular graphs using affine designs
• Perfect state transfer in products and covers of graphs
• An infinite family of incidence geometries whose incidence graphs are locally \(X^\ast\)
• Some locally Kneser graphs
• On flag-transitive symmetric (v, k, 4) designs
• Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least -3
• Using a genetic algorithm for construction of strongly regular graphs with a prescribed automorphism group
• Imprimitive flag-transitive symmetric designs
• 5-chromatic strongly regular graphs
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs

Describes a project that uses

Uses Software

• nauty

This page was built for publication: A root graph that is locally the line graph of the Petersen graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869239)