Complexity of Paired Domination in AT-free and Planar Graphs

12/10/2021
by   Vikash Tripathi, et al.
0

For a graph G=(V,E), a subset D of vertex set V, is a dominating set of G if every vertex not in D is adjacent to atleast one vertex of D. A dominating set D of a graph G with no isolated vertices is called a paired dominating set (PD-set), if G[D], the subgraph induced by D in G has a perfect matching. The Min-PD problem requires to compute a PD-set of minimum cardinality. The decision version of the Min-PD problem remains NP-complete even when G belongs to restricted graph classes such as bipartite graphs, chordal graphs etc. On the positive side, the problem is efficiently solvable for many graph classes including intervals graphs, strongly chordal graphs, permutation graphs etc. In this paper, we study the complexity of the problem in AT-free graphs and planar graph. The class of AT-free graphs contains cocomparability graphs, permutation graphs, trapezoid graphs, and interval graphs as subclasses. We propose a polynomial-time algorithm to compute a minimum PD-set in AT-free graphs. In addition, we also present a linear-time 2-approximation algorithm for the problem in AT-free graphs. Further, we prove that the decision version of the problem is NP-complete for planar graphs, which answers an open question asked by Lin et al. (in Theor. Comput. Sci., 591 (2015): 99-105 and Algorithmica, 82 (2020) :2809-2840).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2021

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...
research
04/06/2021

Upper paired domination versus upper domination

A paired dominating set P is a dominating set with the additional proper...
research
02/25/2023

Cosecure Domination: Hardness Results and Algorithm

For a simple graph G=(V,E) without any isolated vertex, a cosecure domin...
research
10/14/2019

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 ...
research
04/25/2022

Some New Results on Efficient and Perfect Edge Domination of Graphs

A neighborhood star-free graph is one in which every vertex of degree at...
research
05/15/2019

Perfect Italian domination on planar and regular graphs

A perfect Italian dominating function of a graph G=(V,E) is a function f...
research
03/14/2021

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Let G=(V(G),E(G)) be a finite simple undirected graph with vertex set V(...

Please sign up or login with your details

Forgot password? Click here to reset