The weighted independent domination problem is NP-complete for chordal graphs

Authors:
Gerard J. Chang
Affiliations:
Department of Mathematics, National Taiwan University, Taipei 106, Taiwan
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 1
Cited 3

Weighted domination of cocomparability graphs

Discrete Applied Mathematics

Counting the number of independent sets in chordal graphs

Journal of Discrete Algorithms
Note: On the inapproximability of independent domination in 2P3-free perfect graphs

Theoretical Computer Science
Roman domination on strongly chordal graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.06

Visualization

Abstract

An independent dominating set of a graph G = (V,E) is a pairwise non-adjacent subset D of V such that every vertex not in D is adjacent to at least one vertex in D. Suppose each vertex in V is associated with a weight which is a real number. The weighted independent domination problem is to find an independent domination set of minimum total weights. This paper records an unpublished result of 20 years ago that the weighted independent domination problem is NP-complete for chordal graphs.