On cliques in edge-regular graphs

DOI10.1016/j.jalgebra.2014.08.028zbMath1302.05082OpenAlexW1997996034MaRDI 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 graphcliquemaximum cliquepartial geometryHoffman boundedge-regular graphDelsarte boundorbital graphquasiregular cliqueregular clique

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Designs over regular graphs with least eigenvalue \(-2\) ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ On the clique number of a strongly regular graph ⋮ Edge-regular graphs with regular cliques ⋮ 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

Uses Software

• GAP
• GRAPE

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On cliques in edge-regular graphs