On the 2-rainbow domination stable graphs

Zepeng Li, Zehui Shao, Pu Wu and Taiyin Zhao ()
Additional contact information
Zepeng Li: Lanzhou University
Zehui Shao: Guangzhou University
Pu Wu: Guangzhou University
Taiyin Zhao: University of Electronic Science and Technology of China

Journal of Combinatorial Optimization, 2019, vol. 37, issue 4, No 13, 1327-1341

Abstract: Abstract For a graph G, let $$f:V(G)\rightarrow {\mathcal {P}}(\{1,2\}).$$ f : V ( G ) → P ( { 1 , 2 } ) . If for each vertex $$v\in V(G)$$ v ∈ V ( G ) such that $$f(v)=\emptyset $$ f ( v ) = ∅ we have $$\bigcup \nolimits _{u\in N(v)}f(u)=\{1,2\}, $$ ⋃ u ∈ N ( v ) f ( u ) = { 1 , 2 } , then f is called a 2-rainbow dominating function (2RDF) of G. The weightw(f) of f is defined as $$w(f)=\sum _{v\in V(G)}\left| f(v)\right| $$ w ( f ) = ∑ v ∈ V ( G ) f ( v ) . The minimum weight of a 2RDF of G is called the 2-rainbow domination number of G, which is denoted by $$\gamma _{r2}(G)$$ γ r 2 ( G ) . A graph G is 2-rainbow domination stable if the 2-rainbow domination number of G remains unchanged under removal of any vertex. In this paper, we prove that determining whether a graph is 2-rainbow domination stable is NP-hard and characterize 2-rainbow domination stable trees.

Keywords: 2-Rainbow domination; 2-Rainbow domination number; 2-Rainbow domination stable graph; NP-hard; Tree (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0355-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:37:y:2019:i:4:d:10.1007_s10878-018-0355-x

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

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