Algorithmic aspects of majority domination
From MaRDI portal
Publication:1371054
DOI10.11650/twjm/1500405694zbMath0882.05114OpenAlexW2123426099MaRDI QIDQ1371054
Hong-Gwa Yeh, Gerard Jennhwa Chang
Publication date: 2 March 1998
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500405694
algorithmic complexitytreescographs\(k\)-treesmajority dominating functionmajority domination number
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Perfect edge domination and efficient edge domination in graphs ⋮ \(k\)-subdomination in graphs ⋮ Algorithms for vertex-partitioning problems on graphs with fixed clique-width. ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ On complexities of minus domination ⋮ Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination ⋮ On Complexities of Minus Domination
This page was built for publication: Algorithmic aspects of majority domination
