The k-th Roman domination problem is polynomial on interval graphs

Peng Li ()
Additional contact information
Peng Li: Chongqing University of Technology

Journal of Combinatorial Optimization, 2024, vol. 48, issue 3, No 2, 14 pages

Abstract: Abstract Let G be some simple graph and k be any positive integer. Take $$h: V(G)\rightarrow \{0,1,\ldots ,k+1\}$$ h : V ( G ) → { 0 , 1 , … , k + 1 } and $$v \in V(G)$$ v ∈ V ( G ) , let $$AN_{h}(v)$$ A N h ( v ) denote the set of vertices $$w\in N_{G}(v)$$ w ∈ N G ( v ) with $$h(w)\ge 1$$ h ( w ) ≥ 1 . Let $$AN_{h}[v] = AN_{h}(v)\cup \{v\}$$ A N h [ v ] = A N h ( v ) ∪ { v } . The function h is a [k]-Roman dominating function of G if $$h(AN_{h}[v]) \ge |AN_{h}(v)| + k$$ h ( A N h [ v ] ) ≥ | A N h ( v ) | + k holds for any $$v \in V(G)$$ v ∈ V ( G ) . The minimum weight of such a function is called the k-th Roman Domination number of G, which is denoted by $$\gamma _{kR}(G)$$ γ kR ( G ) . In 2020, Banerjee et al. presented linear time algorithms to compute the double Roman domination number on proper interval graphs and block graphs. They posed the open question that whether there is some polynomial time algorithm to solve the double Roman domination problem on interval graphs. It is argued that the interval graph is a nontrivial graph class. In this article, we design a simple dynamic polynomial time algorithm to solve the k-th Roman domination problem on interval graphs for each fixed integer $$k>1$$ k > 1 .

Keywords: Domination; Roman domination; k-th Roman domination; Polynomial time algorithm; Interval graphs (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01206-x 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:48:y:2024:i:3:d:10.1007_s10878-024-01206-x

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

DOI: 10.1007/s10878-024-01206-x

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 ().