Domination using induced cliques in graphs

MaRDI QIDQ2760993zbMATH OpenFDO

Authors Johannes H. Hattingh, L. R. Markus, Jean E. Dunbar, Renu C. Laskar

Publication date 17 December 2001

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

clique\(H\)-domination\(H\)-independence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The diversity of domination
• Domination in Harary graphs
• Dominating sets with small clique covering number
• scientific article; zbMATH DE number 2188424
• \(H\)-adjacent domination in graphs

Cited in

(7)

• Dominating cliques in chordal graphs
• Domination properties and induced subgraphs
• Dominating cliques in graphs
• Clique independence, domination and irredundance in graphs
• \(H\)-adjacent domination in graphs
• \(H\)-domination in graphs
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

This page was built for publication: Domination using induced cliques in graphs

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