2 papers
math.CO2026
Total Roman bondage number of a graph
Fahimeh Khosh-Ahang Ghasr, Sakineh Nazari-Moghaddam
A total Roman dominating function (TRDF) on a graph with no isolated vertices is a function such that every vertex with has a neighbor assigne…
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…