Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4669
Title: Algorithmic aspects of paired disjunctive domination in graphs
Authors: Henning, M.A
Pandey, A.
Tripathi, V.
Keywords: Paired domination
Paired disjunctive domination
Graph algorithms
NP-completeness
Approximation algorithm
Interval graphs
Issue Date: 7-Jul-2024
Abstract: In a graph G = (V , E) without an isolated vertex, a dominating set D ⊆ V is a paired dominating set if the graph G[D] induced by D has a perfect matching. Further, a set D ⊆ V is a disjunctive dominating set of G if for each vertex v ∈ V , either N G [v] ∩ D = ∅ or there are at least two vertices in D whose distance from v is two in G. We introduce the notion of paired disjunctive domination in graphs. A disjunctive dominating set D ⊆ V in the graph G is a paired disjunctive dominating set if G[D] has a perfect matching. The minimum cardinality of a paired disjunctive dominating set of G is the paired disjunctive domination number, denoted by γ d pr(G). In this article, we compute the exact value of γ d pr(G) when G is a path, cycle, cograph, chain graph, and split graph. We prove that the decision version of the problem is NPcomplete for planar graphs, bipartite graphs, and chordal graphs and design a polynomialtime algorithm to compute a minimum cardinality paired disjunctive dominating set in interval graphs. Further, we obtain lower and upper bounds on the approximation ratio of the problem and proved that the problem is APX-complete for the graphs with maximum degree 4.
URI: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4669
Appears in Collections:Year-2023

Files in This Item:
File Description SizeFormat 
full text.pdf595.31 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.