A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Algorithmic aspects of disjunctive domination in graphs
[article]
2015
arXiv
pre-print
For a graph G=(V,E), a set D⊆ V is called a disjunctive dominating set of G if for every vertex v∈ V∖ D, v is either adjacent to a vertex of D or has at least two vertices in D at distance 2 from it. The cardinality of a minimum disjunctive dominating set of G is called the disjunctive domination number of graph G, and is denoted by γ_2^d(G). The Minimum Disjunctive Domination Problem (MDDP) is to find a disjunctive dominating set of cardinality γ_2^d(G). Given a positive integer k and a graph
arXiv:1502.07718v2
fatcat:iixjzu637vcd5ldwx7dzmxc5hu