Results 71 to 80 of about 776,655 (324)

On the total Roman domination in trees

Discussiones Mathematicae Graph Theory, 2019
A total Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the following conditions: (i) every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2 and (ii) the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Marzieh Soroudi, Jafar Amjadi, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +3 more sources

Quasi-total Roman Domination in Graphs [PDF]

Results in Mathematics, 2019
15 ...
Cabrera García, Suitberto, Cabrera Martínez, Abel, Yero, Ismael G.   +2 more
openaire   +5 more sources

Triple Roman domination subdivision number in graphs [PDF]

Computer Science Journal of Moldova, 2022
For a graph $G=(V, E)$, a triple Roman domination function is a function $f: V(G)\longrightarrow\{0, 1, 2, 3, 4\}$ having the property that for any vertex $v\in V(G)$, if $f(v)
Jafar Amjadi, Hakimeh Sadeghi
doaj  

Reconstructing the impact of human activities in a NW Iberian Roman mining landscape for the last 2500 years [PDF]

, 2014
This article was made available through the Brunel Open Access Publishing Fund.Little is known about the impact of human activities during Roman times on NW Iberian mining landscapes beyond the geomorphological transformations brought about by the use of
Antonio Martínez Cortizas, Birks, Blaauw, Breitenlechner, Camino Mayor, Camino Mayor, Carrión, Carrión, Carrión, Conedera, Currás, Dearing, Dearing, Domergue, Domergue, Domergue, Edmondson, Fanjul Peraza, Fernández Mier, Gil Sánchez, Guillermo S. Reher, Hammer, Hong, Joly, José A. López-Sáez, Jouffroy-Bapicot, Kaal, Kylander, Le Roux, Lourdes López-Merino, Ludemann, Ludemann, López-Merino, López-Merino, López-Merino, López-Merino, López-Merino, López-Merino, Martínez Alcíbar, Martínez Cortizas, Martínez Cortizas, Martínez Cortizas, Martínez Cortizas, Martínez Cortizas, Martínez Cortizas, Marín Suárez, Mighall, Mighall, Mighall, Mighall, Monna, Monna, Moore, Morales-Molino, Morales-Molino, Muñoz Sobrino, Muñoz Sobrino, Olid, Orejas, Orejas, Paillette, Perea, Pontevedra-Pombal, Reher, Reille, Richard Bindler, Rodríguez Otero, Sande Silva, Schellekens, Schulz, Silva Sánchez, Sánchez-Palencia, Sánchez-Palencia, Sánchez-Palencia, Sánchez-Palencia, Tim M. Mighall, Valbuena-Carabaña, Villa Valdés   +77 more
core   +2 more sources

Survey on Roman {2}-Domination

Mathematics
The notion of Roman {2}-domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire.
Ahlam Almulhim, Bana Al Subaiei, Saiful Rahman Mondal   +2 more
doaj   +1 more source

Roman Domination in Complementary Prism Graphs [PDF]

, 2012
A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core   +2 more sources

Total Roman {3}-domination in Graphs [PDF]

Symmetry, 2020
For a graph G = ( V , E ) with vertex set V = V ( G ) and edge set E = E ( G ) , a Roman { 3 } -dominating function (R { 3 } -DF) is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that ∑ u ∈ N G ( v ) f ( u ) ≥ 3 , if f ( v ) = 0 , and ∑ u ∈ N G ( v ) f ( u
Shao, Zehui, Mojdeh, Doost Ali, Volkmann, Lutz   +2 more
openaire   +3 more sources

Strong equality of Roman and perfect Roman Domination in trees

RAIRO Oper. Res., 2022
A Roman dominating function (RD-function) on a graph $G = (V, E)$ is a function $f: V \longrightarrow \{0, 1, 2\}$ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$.
Z. Shao, S. Kosari, Hadi Rahbani, M. Sharifzadeh, S. Sheikholeslami   +4 more
semanticscholar   +1 more source

Lower and upper bounds on independent double Roman domination in trees

Electronic Journal of Graph Theory and Applications, 2022
For a graph G = ( V, E ) , a double Roman dominating function (DRDF) f : V → { 0 , 1 , 2 , 3 } has the property that for every vertex v ∈ V with f ( v ) = 0 , either there exists a neighbor u ∈ N ( v ) , with f ( u ) = 3 , or at least two neighbors x, y ∈
M. Kheibari, H. Ahangar, R. Khoeilar, S. Sheikholeslami   +3 more
semanticscholar   +1 more source

Roman domination number of Generalized Petersen Graphs P(n,2) [PDF]

, 2011
A $Roman\ domination\ function$ on a graph $G=(V, E)$ is a function $f:V(G)\rightarrow\{0,1,2\}$ satisfying the condition that every vertex $u$ with $f(u)=0$ is adjacent to at least one vertex $v$ with $f(v)=2$.
Ji, Chunnian, Wang, Haoli, Xu, Xirong, Yang, Yuansheng   +3 more
core