Majority domination in graphs
From MaRDI portal
Publication:1842153
DOI10.1016/0012-365X(94)00194-NzbMath0820.05037OpenAlexW2038457140MaRDI QIDQ1842153
Izak Broere, Alice A. McRae, Johannes H. Hattingh, Michael A. Henning
Publication date: 22 August 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00194-n
NP-completeweightmajority dominationnumerical invariantmajority dominating functionmajority domination numbermajority number
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (23)
\(k\)-subdomination in graphs ⋮ Algorithms for vertex-partitioning problems on graphs with fixed clique-width. ⋮ Opinion functions on trees ⋮ Minus \(k\)-subdomination in graphs. II ⋮ The signed and minus \(k\)-subdomination numbers of comets ⋮ The power of small coalitions under two-tier majority on regular graphs ⋮ Complexity of majority monopoly and signed domination problems ⋮ Some results on majority bad number ⋮ On the signed star domination number of regular multigraphs ⋮ Lower bounds on several versions of signed domination number ⋮ The effect of local majority on global majorityin connected graphs ⋮ On edge domination numbers of graphs ⋮ The signed star domination numbers of the Cartesian product graphs ⋮ Majority reinforcement number ⋮ On signed majority total domination in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ On signed cycle domination in graphs ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Some remarks on domination in cubic graphs ⋮ Majority bad number ⋮ Majority Roman domination in graphs ⋮ On the trees with same signed edge and signed star domination numbers
Cites Work
This page was built for publication: Majority domination in graphs
