A criterion for the \(t\)-vertex condition of graphs

DOI10.1006/jcta.1999.3045zbMath0947.05088OpenAlexW1985756308MaRDI QIDQ1570760

Sven Reichard

Publication date: 5 November 2000

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

Full work available at URL: https://doi.org/10.1006/jcta.1999.3045

zbMATH Keywords

strongly regular graphs\(t\)-vertex condition\(k\)-isoregularity condition

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

Homogeneous edge-disjoint $K_{2s}$ and $T_{st,t}$ unions ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Steiner triple systems satisfying the 4-vertex condition ⋮ On highly regular strongly regular graphs ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ Strongly regular graphs with the \(7\)-vertex condition

Cites Work

• Non rank 3 strongly regular graphs with the 5-vertex condition
• Some new strongly regular graphs
• Two families of strongly regular graphs with the 4-vertex condition
• The Rank 3 Permutation Representations of the Finite Classical Groups
• The Finite Primitive Permutation Groups of Rank Three
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item