Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/2447
Title: Algorithmic aspects of semitotal domination in graphs
Authors: Henning, M. A.
Pandey, A.
Keywords: Domination
Semitotal domination
Bipartite graphs
Chordal graphs
Interval graphs
Graph algorithm
NP-complete
Approximation algorithm
APX-complete
Issue Date: 21-Aug-2021
Abstract: For a graph G = (V , E), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is to find a semitotal dominating set of minimum cardinality. Given a graph G and a positive integer k, the Semitotal Domination Decision problem is to decide whether G has a semitotal dominating set of cardinality at most k. The Semitotal Domination Decision problem is known to be NP-complete for general graphs. In this paper, we show that the Semitotal Domination Decision problem remains NP-complete for planar graphs, split graphs and chordal bipartite graphs. We give a polynomial time algorithm to solve the Minimum Semitotal Domination problem in interval graphs. We show that the Minimum Semitotal Domination problem in a graph with maximum degree admits an approximation algorithm that achieves the approximation ratio of 2+3 ln(+1), showing that the problem is in the class log-APX. We also show that the Minimum Semitotal Domination problem cannot be approximated within (1−)ln |V | for any > 0 unless NP ⊆ DTIME (|V | O(log log |V |) ). Finally, we prove that the Minimum Semitotal Domination problem is APX-complete for bipartite graphs with maximum degree 4.
URI: http://localhost:8080/xmlui/handle/123456789/2447
Appears in Collections:Year-2019

Files in This Item:
File Description SizeFormat 
Full Text.pdf493.73 kBAdobe PDFView/Open    Request a copy


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