Lower bounds on the minus domination and \(k\)-subdomination numbers.

DOI10.1016/S0304-3975(02)00434-6zbMath1046.68078MaRDI QIDQ1401262

Erfang Shan, Ding-Zhu Du, Hong Qiao, Li-ying Kang

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(k\)-subdominationDomination numberMinus domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

The algorithmic complexity of the minus clique-transversal problem ⋮ Upper minus domination in a claw-free cubic graph ⋮ On the mixed minus domination in graphs ⋮ The power of small coalitions under two-tier majority on regular graphs ⋮ Minus domination number in \(k\)-partite graphs. ⋮ Remarks on the minus (signed) total domination in graphs ⋮ Upper minus total domination in small-degree regular graphs ⋮ An application of the Turán theorem to domination in graphs ⋮ Lower bounds on several versions of signed domination number ⋮ Total minus domination in \(k\)-partite graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minus domination in graphs
• Upper bounds for the \(k\)-subdomination number of graphs
• Inequalities relating domination parameters in cubic graphs
• The algorithmic complexity of minus domination in graphs
• Strict majority functions on graphs

This page was built for publication: Lower bounds on the minus domination and \(k\)-subdomination numbers.