On the complexity of some hop domination parameters

Nader Jafari Rad, Elahe Shabani

Abstract


A hop Roman dominating function (HRDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} having the property that for every vertex v ∈ V with f(v) = 0 there is a vertex u with f(u) = 2 and d(u, v) = 2. The weight of an HRDF f is the sum of its values on V. The minimum weight of an HRDF on G is called the hop Roman domination number of G. An HRDF f is a hop Roman independent dominating function (HRIDF) if for any pair v, w with f(v) > 0 and f(w) > 0, d(v, w) ≠ 2. The minimum weight of an HRIDF on G is called the hop Roman independent domination number of G. In this paper, we study the complexity of the hop independent dominating problem, the hop Roman domination function problem and the hop Roman independent domination function problem, and show that the decision problem for each of the above three problems is NP-complete even when restricted to planar bipartite graphs or planar chordal graphs.


Keywords


dominating set, hop dominating set, hop independent set, hop Roman dominating function, hop Roman independent dominating function, complexity

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2019.7.1.6

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats