Results 61 to 70 of about 10,626,776 (155)

A Roman Domination Chain

open access: yes, 2016
For a graph (Formula presented.), a Roman dominating function (Formula presented.) has the property that every vertex (Formula presented.) with (Formula presented.) has a neighbor (Formula presented.) with (Formula presented.).
Haynes, Teresa W.   +4 more
core   +1 more source

Roman Domination Cover Rubbling [PDF]

open access: yes, 2019
In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of ...
Carney, Nicholas
core   +1 more source

Bounds on the Hop Double Roman Domination Number of Graphs.

open access: yes
In this paper, we establish sharp upper and lower bounds for this parameter. These results provide the first systematic study of hop double Roman domination and lay the foundation for future investigations into its structural and computational aspects.
Mohammad Marvic   +6 more
core   +1 more source

Trees with equal Roman {2}-domination number and independent Roman {2}-domination number

open access: yes, 2019
A Roman {2}-dominating function (R{2}DF) on a graph G =(V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to either at least one vertex v with f(v) = 2 or two vertices v1, v2 with f(v1) = f ...
Zepeng Li   +3 more
core   +1 more source

Signed double Roman k-domination in digraphs

open access: yes
Let D be a finite simple digraph with vertex set V(D), and let k≥1 be an integer. A signed double Roman k-dominating function (SDRkDF) on a digraph D is a function f: V(D) → {-1,1,2,3} satisfying certain conditions.
Zverovich, Vadim, Volkmann, Lutz
core  

Triple-Knockout, Synuclein-Free Mice Display Compromised Lipid Pattern. [PDF]

open access: yesMolecules, 2021
Guschina IA   +4 more
europepmc   +1 more source

Roman game domination subdivision number of a graph [PDF]

open access: yes, 2013
A {em Roman dominating function} on a graph $G = (V ,E)$ is a function $f : Vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. The {em weight} of a
Seyed Mahmoud Sheikholeslami   +7 more
core   +1 more source

Home - About - Disclaimer - Privacy