Please use this identifier to cite or link to this item:
http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4669
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Henning, M.A | - |
dc.contributor.author | Pandey, A. | - |
dc.contributor.author | Tripathi, V. | - |
dc.date.accessioned | 2024-07-07T07:46:00Z | - |
dc.date.available | 2024-07-07T07:46:00Z | - |
dc.date.issued | 2024-07-07 | - |
dc.identifier.uri | http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/4669 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Paired domination | en_US |
dc.subject | Paired disjunctive domination | en_US |
dc.subject | Graph algorithms | en_US |
dc.subject | NP-completeness | en_US |
dc.subject | Approximation algorithm | en_US |
dc.subject | Interval graphs | en_US |
dc.title | Algorithmic aspects of paired disjunctive domination in graphs | en_US |
dc.type | Article | en_US |
Appears in Collections: | Year-2023 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
full text.pdf | 595.31 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.