Dominating cliques in graphs

Margaret B. Cozzens, Laura L. Kelleher

Research output: Contribution to journalArticlepeer-review

47 Scopus citations


A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding a dominating clique. A forbidden subgraph characterization is given for a class of graphs that have a connected dominating set of size three.

Original languageEnglish (US)
Pages (from-to)101-116
Number of pages16
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Dec 14 1990
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Dominating cliques in graphs'. Together they form a unique fingerprint.

Cite this