On cliques in edge-regular graphs

DOI10.1016/j.jalgebra.2014.08.028zbMath1302.05082MaRDI QIDQ468702

Leonard H. Soicher

Publication date: 7 November 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.08.028

zbMATH Keywords

strongly regular graph; clique; maximum clique; partial geometry; Hoffman bound; edge-regular graph; Delsarte bound; orbital graph; quasiregular clique; regular clique

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

A general construction of strictly Neumaier graphs and a related switching, Designs over regular graphs with least eigenvalue \(-2\), Edge-regular graphs with regular cliques, On the clique number of a strongly regular graph, Upper bounds on the size of transitive subtournaments in digraphs, An infinite class of Neumaier graphs and non-existence results, Bounds for regular induced subgraphs of strongly regular graphs, The smallest strictly Neumaier graph and its generalisations

Uses Software

• GAP
• GRAPE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spreads in strongly regular graphs
• More on block intersection polynomials and new applications to graphs and block designs
• Strongly regular graphs, partial geometries and partially balanced designs
• Block intersection polynomials