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

cliqueDelsarte boundedge-regular graphHoffman boundmaximum cliqueorbital graphpartial geometryquasiregular cliqueregular cliquestrongly regular graph

Mathematics Subject Classification ID

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

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

• Block intersection polynomials
• Combinatorics of optimal designs
• 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?)
• 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

(19)

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

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)