ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Complexity of distance paired-domination problem in graphs

Chang, Gerard J and Panda, BS and Pradhan, D (2012) Complexity of distance paired-domination problem in graphs. In: THEORETICAL COMPUTER SCIENCE, 459 . pp. 89-99.

[img] PDF
the_com_sci_459_89_2012.pdf - Published Version
Restricted to Registered users only

Download (371kB) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.tcs.2012.08.024

Abstract

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Item Type: Journal Article
Additional Information: Copyright for this article belongs to Elsevier
Keywords: Distance k-dominating set; Distance k-paired-dominating set; Strongly chordal graph; Undirected path graph; NP-complete; Approximation algorithm; APX-complete
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Francis Jayakanth
Date Deposited: 19 Dec 2012 10:58
Last Modified: 19 Dec 2012 10:58
URI: http://eprints.iisc.ac.in/id/eprint/45547

Actions (login required)

View Item View Item