Strongly regular graphs with the \(7\)-vertex condition

DOI10.1007/s10801-014-0554-1zbMath1314.05235arXiv1401.6816OpenAlexW2167323005MaRDI QIDQ2346763

Sven Reichard

Publication date: 4 June 2015

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.6816

zbMATH Keywords

strongly regular graphgeneralized quadrangle\(t\)-vertex condition

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras ⋮ Unnamed Item ⋮ On highly regular strongly regular graphs

Cites Work

• Spectra of graphs
• Steiner triple systems satisfying the 4-vertex condition
• A prolific construction of strongly regular graphs with the \(n\)-e. c. property
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Non rank 3 strongly regular graphs with the 5-vertex condition
• Some new strongly regular graphs
• Strongly regular graphs having strongly regular subconstituents
• Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
• An optimal lower bound on the number of variables for graph identification
• Strongly regular graphs and spin models for the Kauffman polynomial
• On rank 3 permutation groups
• Relation algebras and \(t\)-vertex condition graphs
• On highly closed cellular algebras and highly closed isomorphisms
• Two families of strongly regular graphs with the 4-vertex condition
• A criterion for the \(t\)-vertex condition of graphs
• Coherent configurations and triply regular association schemes obtained from spherical designs
• Strongly regular graphs, partial geometries and partially balanced designs
• Schemes for deterministic polynomial factoring
• Universally optimal distribution of points on spheres
• The Rank 3 Permutation Representations of the Finite Classical Groups
• The Finite Primitive Permutation Groups of Rank Three
• PARTIAL QUADRANGLES
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• The nonexistence of certain tight spherical designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly regular graphs with the \(7\)-vertex condition