Weighted upper domination number

DOI10.1016/j.endm.2017.10.030zbMath1383.05228OpenAlexW2766654187MaRDI QIDQ2413167

Arman Boyacı, Jérôme Monnot

Publication date: 9 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.030

zbMATH Keywords

split graphsNP-hardnessinapproximabilitymaximum weighted minimal dominating setplanar bipartite

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (4)

Formalization of the Domination Chain with Weighted Parameters (Short Paper) ⋮ In)approximability of Maximum Minimal FVS ⋮ Weighted Upper Edge Cover: Complexity and Approximability ⋮ (In)approximability of maximum minimal FVS

Cites Work

• Unnamed Item
• On the computational complexity of upper fractional domination
• Approximability results for the maximum and minimum maximal induced matching problems
• Contributions to the theory of domination, independence and irredundance in graphs
• Chordal graphs and upper irredundance, upper domination and independence
• A Boundary Property for Upper Domination
• Upper Domination: Complexity and Approximation
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective
• A Dichotomy for Upper Domination in Monogenic Classes
• Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation

This page was built for publication: Weighted upper domination number