On cliques in edge-regular graphs

DOI10.1016/J.JALGEBRA.2014.08.028MaRDI QIDQ468702zbMATH OpenOpenAlexFDO

Authors 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

maximum cliquestrongly regular graphcliquepartial geometryedge-regular graphHoffman boundDelsarte boundorbital graphquasiregular cliqueregular clique

Mathematics Subject Classification ID

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

Recommendations

• Edge-regular graphs with regular cliques
• On cliques in isoregular graphs
• scientific article; zbMATH DE number 19181
• On cliques in graphs
• The clique numbers of regular graphs
• Edge-clique graphs
• Another construction of edge-regular graphs with regular cliques
• Regular clique assemblies, configurations, and friendship in edge-regular graphs
• On a class of edge-regular graphs
• On the clique number of a strongly regular graph

Cites work

• scientific article; zbMATH DE number 5130692 (Why is no real title available?)
• scientific article; zbMATH DE number 3730160 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 524145 (Why is no real title available?)
• scientific article; zbMATH DE number 976829 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Block intersection polynomials
• Combinatorics of optimal designs
• More on block intersection polynomials and new applications to graphs and block designs
• Spreads in strongly regular graphs
• Strongly regular graphs, partial geometries and partially balanced designs

Cited in

(18)

• Designs over regular graphs with least eigenvalue \(-2\)
• Completely regular clique graphs. II
• Completely regular clique graphs
• scientific article; zbMATH DE number 4073007 (Why is no real title available?)
• Edge clique graphs and some classes of chordal graphs
• On the clique number of a strongly regular graph
• Bounds for regular induced subgraphs of strongly regular graphs
• The smallest strictly Neumaier graph and its generalisations
• scientific article; zbMATH DE number 4139786 (Why is no real title available?)
• Upper bounds on the size of transitive subtournaments in digraphs
• A general construction of strictly Neumaier graphs and a related switching
• Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
• On cliques in isoregular graphs
• Edge-clique graphs
• On the Existence of Small Strictly Neumaier Graphs
• Edge-regular graphs with regular cliques
• An infinite class of Neumaier graphs and non-existence results
• Another construction of edge-regular graphs with regular cliques

Describes a project that uses

Uses Software

• GRAPE
• GAP

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

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