On majority domination in graphs
From MaRDI portal
Publication:5946744
DOI10.1016/S0012-365X(00)00370-8zbMath0982.05072OpenAlexW2011180679MaRDI QIDQ5946744
Publication date: 19 March 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00370-8
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
The power of small coalitions under two-tier majority on regular graphs ⋮ Some results on majority bad number ⋮ Majority reinforcement number ⋮ On signed majority total domination in graphs ⋮ 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 ⋮ Majority bad number ⋮ Majority Roman domination in graphs
This page was built for publication: On majority domination in graphs
