Results 61 to 70 of about 1,131,018 (144)

Signed total domination number of a graph [PDF]

open access: yes, 2001
summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core  

Upper signed domination number

open access: yes, 2008
Let G=(V,E) be a graph. A signed dominating function on G is a function f:V→{-1,1} such that ∑u∈N[v]f(u)⩾1 for each v∈V, where N[v] is the closed neighborhood of v. The weight of a signed dominating function f is ∑v∈Vf(v).
Chen, Yaojun, Tang, Huajun
core   +1 more source

Roman domination on graphs

open access: yes, 2010
A Roman dominating function of a graph G is a function f : V (G) → {0, 1, 2} such that whenever f(v) = 0 there xists a vertex u adjacent to v such that f(u) = 2. The weight of f is w(f) = Pv∈V (G) f(v).
劉俊宏, Liu, Chun-Hung
core  

The Effects of Parenting Styles on Internalizing and Externalizing Behaviors: A Mexican Preadolescents Study. [PDF]

open access: yesInt J Psychol Res (Medellin), 2020
Fuentes-Balderrama J   +5 more
europepmc   +1 more source

Survey on Roman {2}-Domination

open access: yes
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.
Bana Al Subaiei   +2 more
core   +1 more source

Reduced diversity in human mitogenomes from Eivissa (Balearic Islands). [PDF]

open access: yesFront Genet
Verdesca LC   +8 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy