\(H\)-domination in graphs

DOI10.1016/S0012-365X(03)00187-0zbMath1029.05117OpenAlexW1975296290MaRDI QIDQ1415548

Peter J. Slater, Bock Boom Lim, Khee Meng Koh

Publication date: 4 December 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00187-0

zbMATH Keywords

\(H\)-dominationEfficient dominationPaired domination

Mathematics Subject Classification ID

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

Cites Work

• Permutation graphs: Connected domination and Steiner trees
• On connected cutfree domination in graphs
• Minimum dominating cycles in 2-trees
• Paired-domination
• Paired-domination in graphs
• Dominating cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(H\)-domination in graphs