Minus domination number in \(k\)-partite graphs.

DOI10.1016/J.DISC.2003.07.008zbMath1033.05077OpenAlexW1974622345MaRDI QIDQ1426125

Moo Young Sohn, Hye Kyung Kim, Li-ying Kang

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.07.008

zbMATH Keywords

\(k\)-partite graphDominationMinus domination

Mathematics Subject Classification ID

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

Related Items (11)

Upper minus domination in a claw-free cubic graph ⋮ The minus total k-domination numbers in 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 ⋮ Total minus domination in \(k\)-partite graphs ⋮ Minus total domination in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Unnamed Item ⋮ Positive influence domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minus domination in graphs
• Lower bounds on the minus domination and \(k\)-subdomination numbers.
• 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: Minus domination number in \(k\)-partite graphs.