Semipaired Domination in Some Subclasses of Chordal Graphs

A dominating set D of a graph G without isolated vertices is called semipaired dominating set if D can be partitioned into 2-element subsets such that the vertices in each set are at distance at most 2. The semipaired domination number, denoted by γ_pr2(G) is the minimum cardinality of a semipaired dominating set of G. Given a graph G with no isolated vertices, the Minimum Semipaired Domination problem is to find a semipaired dominating set of G of cardinality γ_pr2(G). The decision version of the Minimum Semipaired Domination problem is already known to be NP-complete for chordal graphs, an important graph class. In this paper, we show that the decision version of the Minimum Semipaired Domination problem remains NP-complete for split graphs, a subclass of chordal graphs. On the positive side, we propose a linear-time algorithm to compute a minimum cardinality semipaired dominating set of block graphs. In addition, we prove that the Minimum Semipaired Domination problem is APX-complete for graphs with maximum degree 3.

Authors

• 4 publications
• 4 publications
• 3 publications
• Complexity and Algorithms for Semipaired Domination in Graphs

For a graph G=(V,E) with no isolated vertices, a set D⊆ V is called a se...
04/01/2019 ∙ by Michael A. Henning, et al. ∙ 0

• On Minimum Dominating Sets in cubic and (claw,H)-free graphs

Given a graph G=(V,E), S⊆ V is a dominating set if every v∈ V∖ S is adja...
02/27/2020 ∙ by Valentin Bouquet, et al. ∙ 0

• A linear-time algorithm for semitotal domination in strongly chordal graphs

In a graph G=(V,E) with no isolated vertex, a dominating set D ⊆ V, is c...
09/05/2021 ∙ by Vikash Tripathi, et al. ∙ 0

• Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems

Given an orthogonal connected arrangement of line-segments, Minimum Corr...
02/11/2019 ∙ by Remi Raman, et al. ∙ 0

• Algorithm and hardness results on neighborhood total domination in graphs

A set D⊆ V of a graph G=(V,E) is called a neighborhood total dominating ...
10/14/2019 ∙ by Anupriya Jha, et al. ∙ 0

• Orthogonal Terrain Guarding is NP-complete

A terrain is an x-monotone polygonal curve, i.e., successive vertices ha...
10/01/2017 ∙ by Édouard Bonnet, et al. ∙ 0