On the Roman domination subdivision number of a graph

J. Amjadi (), R. Khoeilar (), M. Chellali () and Z. Shao ()
Additional contact information
J. Amjadi: Azarbaijan Shahid Madani University
R. Khoeilar: Azarbaijan Shahid Madani University
M. Chellali: University of Blida
Z. Shao: Guangzhou University

Journal of Combinatorial Optimization, No 0, 11 pages

Abstract: Abstract A Roman dominating function (RDF) of a graph G is a labeling $$f:V(G)\longrightarrow \{0,1,2\}$$f:V(G)⟶{0,1,2} such that every vertex with label 0 has a neighbor with label 2. The weight of an RDF is the sum of its functions values over all vertices, and the Roman domination number of G is the minimum weight of an RDF of G. The Roman domination subdivision number $$\mathrm {sd}_{\gamma _{R}}(G)$$sdγR(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the Roman domination number of G. In this paper, we present a new upper bound on the Roman domination subdivision number by showing that for every connected graph G of order at least three, $$\begin{aligned} \mathrm {sd}_{\gamma _{R}}(G)\le 3+\min \{\deg _2(v)\mid v\in V\;\mathrm {and} \;d(v)\ge 2\}, \end{aligned}$$sdγR(G)≤3+min{deg2(v)∣v∈Vandd(v)≥2},where $$\deg _2(v)$$deg2(v) is the number of vertices of G at distance 2 from vertex v. Moreover, we show that the decision problem associated with $$\mathrm {sd}_{\gamma _{R}}(G)$$sdγR(G) is NP-hard for bipartite graphs.

Keywords: Roman domination; Roman domination subdivision number; NP-hardness; 05C69 (search for similar items in EconPapers)
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00597-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::y::i::d:10.1007_s10878-020-00597-x

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

DOI: 10.1007/s10878-020-00597-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 ().