Roman {k}-domination in trees and complexity results for some classes of graphs

Cai-Xia Wang, Yu Yang, Hong-Juan Wang and Shou-Jun Xu ()
Additional contact information
Cai-Xia Wang: Lanzhou University
Yu Yang: Lanzhou University
Hong-Juan Wang: Lanzhou University
Shou-Jun Xu: Lanzhou University

Journal of Combinatorial Optimization, 2021, vol. 42, issue 1, No 9, 174-186

Abstract: Abstract In this paper, we study Roman {k}-dominating functions on a graph G with vertex set V for a positive integer k: a variant of {k}-dominating functions, generations of Roman $$\{2\}$$ { 2 } -dominating functions and the characteristic functions of dominating sets, respectively, which unify classic domination parameters with certain Roman domination parameters on G. Let $$k\ge 1$$ k ≥ 1 be an integer, and a function $$f:V \rightarrow \{0,1,\dots ,k\}$$ f : V → { 0 , 1 , ⋯ , k } defined on V called a Roman $$\{k\}$$ { k } -dominating function if for every vertex $$v\in V$$ v ∈ V with $$f(v)=0$$ f ( v ) = 0 , $$\sum _{u\in N(v)}f(u)\ge k$$ ∑ u ∈ N ( v ) f ( u ) ≥ k , where N(v) is the open neighborhood of v in G. The minimum value $$\sum _{u\in V}f(u)$$ ∑ u ∈ V f ( u ) for a Roman $$\{k\}$$ { k } -dominating function f on G is called the Roman $$\{k\}$$ { k } -domination number of G, denoted by $$\gamma _{\{Rk\}}(G)$$ γ { R k } ( G ) . We first present bounds on $$\gamma _{\{Rk\}}(G)$$ γ { R k } ( G ) in terms of other domination parameters, including $$\gamma _{\{Rk\}}(G)\le k\gamma (G)$$ γ { R k } ( G ) ≤ k γ ( G ) . Secondly, we show one of our main results: characterizing the trees achieving equality in the bound mentioned above, which generalizes M.A. Henning and W.F. klostermeyer’s results on the Roman {2}-domination number (Henning and Klostermeyer in Discrete Appl Math 217:557–564, 2017). Finally, we show that for every fixed $$k\in \mathbb {Z_{+}}$$ k ∈ Z + , associated decision problem for the Roman $$\{k\}$$ { k } -domination is NP-complete, even for bipartite planar graphs, chordal bipartite graphs and undirected path graphs.

Keywords: Roman $$\{k\}$$ { k } -domination number; Domination number; Trees; NP-complete (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00735-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:42:y:2021:i:1:d:10.1007_s10878-021-00735-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00735-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().