Minus domination in small-degree graphs

DOI10.1016/S0166-218X(00)00219-5zbMath0971.05086MaRDI QIDQ5928868

Peter Damaschke

Publication date: 1 November 2001

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

zbMATH Keywords

complexity of computingminus domination numbersigned domination number

Mathematics Subject Classification ID

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

Related Items (13)

Algorithmic Aspect of Minus Domination on Small-Degree Graphs ⋮ INVERSE MINUS DOMINATION IN GRAPHS ⋮ Algorithms and Hardness for Signed Domination ⋮ Upper minus total domination in small-degree regular graphs ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ An application of the Turán theorem to domination in graphs ⋮ On complexities of minus domination ⋮ Dominating functions with integer values in graphs—a survey ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Complexities of Minus Domination

Cites Work

• Minus domination in graphs
• Signed domination in regular graphs
• Minus domination in regular graphs
• The algorithmic complexity of minus domination in graphs
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• On approximation properties of the Independent set problem for degree 3 graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minus domination in small-degree graphs