2 papers
math.CO2019
On the total and strong version for Roman dominating functions in graphs
S. Nazari-Moghaddam, M. Soroudi, S. M. Sheikholeslami +1
Consider a finite and simple graph with maximum degree . A strong Roman dominating function over the graph is understood as a map $f : V (G)\rightarrow \{0, 1,\ldo…
math.CO2018
Changing and unchanging 2-rainbow independent domination
Pu Wu, Zehui Shao, Vladimir Samodivkin +3
For a function we denote by the set of vertices to which the value is assigned by , i.e. . If…