On cliques in isoregular graphs

DOI10.1134/S1064562411040156zbMATH Open1236.05153MaRDI QIDQ656384FDOQ656384

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)

Cites Work

• Title not available (Why is that?)
• 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
• Strongly regular graph with parameters \((486, 112, 36, 66)\) does not exist

Cited In (2)

• On smallest regular graphs with a given isopart
• On cliques in edge-regular graphs

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)