A linear time algorithm for minimum equitable dominating set in trees
Keyword(s):
Let G = (V, E) be a graph. A subset De of V is said to be an equitable dominating set if for every v ∈ V \ De there exists u ∈ De such that uv ∈ E and |deg(u) − deg(v)| ≤ 1, where, deg(u) and deg(v) denote the degree of the vertices u and v respectively. An equitable dominating set with minimum cardinality is called the minimum equitable dominating set and its cardinality is called the equitable domination number and it is denoted by γe. The problem of finding minimum equitable dominating set in general graphs is NP-complete. In this paper, we give a linear time algorithm to determine minimum equitable dominating set of a tree.
2021 ◽
Vol vol. 23 no. 1
(Discrete Algorithms)
◽
Keyword(s):
Keyword(s):
2020 ◽
Vol 28
(3)
◽
pp. 153-170
Keyword(s):
2019 ◽
Vol 39
(1)
◽
pp. 55-71
◽
Keyword(s):
2017 ◽
Vol 09
(04)
◽
pp. 1750045
◽
Keyword(s):