On cliques in isoregular graphs

DOI10.1134/S1064562411040156MaRDI QIDQ656384zbMATH OpenFDO

Authors Alexandre A. Makhnev

Publication date 17 January 2012

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

pseudo-geometric graphstrongly regular graph, edge-regular graph

Mathematics Subject Classification ID

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

Recommendations

• On cliques in edge-regular graphs
• Another construction of edge-regular graphs with regular cliques
• Edge-regular graphs with regular cliques
• Regular clique assemblies, configurations, and friendship in edge-regular graphs
• On regular graphs every edge of which lies in a large number of triangles

Cites work

• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• More on block intersection polynomials and new applications to graphs and block designs
• On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound
• Strongly regular graph with parameters \((486, 112, 36, 66)\) does not exist

Cited in

(5)

• On cliques in edge-regular graphs
• On smallest regular graphs with a given isopart
• Completely regular clique graphs. II
• Completely regular clique graphs
• Another construction of edge-regular graphs with regular cliques

This page was built for publication: On cliques in isoregular graphs

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