\(k\)-subdomination in graphs

DOI10.1016/S0166-218X(01)00280-3zbMath1008.05110MaRDI QIDQ1613364

Hong-Gwa Yeh, Sheng-Chyang Liaw, Gerard Jennhwa Chang

Publication date: 29 August 2002

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

zbMATH Keywords

treedominationmajority dominationsigned dominationleaf\(k\)-subdomination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

The power of small coalitions under two-tier majority on regular graphs ⋮ Lower bounds on several versions of signed domination number ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Signed (total) domination numbers and Laplacian spectrum of graphs ⋮ Signed domination numbers of a graph and its complement

Cites Work

• Generalized domination and efficient domination in graphs
• Signed domination in regular graphs and set-systems
• Algorithmic aspects of majority domination
• Inequalities relating domination parameters in cubic graphs
• Some remarks on domination in cubic graphs
• Signed domination in regular graphs
• Majority domination in graphs
• Strict majority functions on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(k\)-subdomination in graphs