On cliques in isoregular graphs

DOI10.1134/S1064562411040156zbMath1236.05153MaRDI QIDQ656384

Aleksandr Alekseevich 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)

Cites Work

• Unnamed Item
• Strongly regular graph with parameters \((486, 112, 36, 66)\) does not exist
• On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound
• More on block intersection polynomials and new applications to graphs and block designs

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