Results 261 to 270 of about 7,042,445 (296)
Models of Cultural Reproduction as Drivers of Socio-cultural Resilience: Insights from a Systematic Review. [PDF]
F1000ResAlfaqi MZ +4 more
europepmc +1 more source
Individual- and community-level factors associated with intimate partner controlling behavior among women in Somaliland: a multilevel analysis of the 2020 Somaliland demographic and health survey. [PDF]
Front Public HealthNuh AM +8 more
europepmc +1 more source
AWhen screams go unheard: covert violence, women victims, and social denial. [PDF]
BMC Womens HealthSaedi Z +3 more
europepmc +1 more source
Total Version of the Domination Game [PDF]
Graphs and Combinatorics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Quaestiones Mathematicae, 2015
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +3 more sources
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +3 more sources
Total domination and transformation
Information Processing Letters, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter Kratsch, Lorna Stewart
openaire +3 more sources
Networks, 1980
AbstractA set D of vertices of a finite, undirected graph G = (V, E) is a total dominating set if every vertex of V is adjacent to some vertex of D. In this paper we initiate the study of total dominating sets in graphs and, in particular, obtain results concerning the total domination number of G (the smallest number of vertices in a total dominating ...
Ernest J. Cockayne +2 more
openaire +3 more sources
AbstractA set D of vertices of a finite, undirected graph G = (V, E) is a total dominating set if every vertex of V is adjacent to some vertex of D. In this paper we initiate the study of total dominating sets in graphs and, in particular, obtain results concerning the total domination number of G (the smallest number of vertices in a total dominating ...
Ernest J. Cockayne +2 more
openaire +3 more sources
A note on domination and total domination in prisms
Journal of Combinatorial Optimization, 2017Let \(G=(V,E)\) be a simple graph. A subset \(S \subseteq V\) is a dominating set if every vertex \(v \in V\setminus S\) is adjacent to a vertex in S. The minimum cardinality of a dominating set, denoted by \(\gamma(G)\), called the domination number of graph \(G\).
Wayne Goddard, Michael A. Henning
openaire +3 more sources
Total Dominator Colorings and Total Domination in Graphs
Graphs and Combinatorics, 2014Given a graph \(G\), a total dominator coloring is a proper coloring of the vertices of \(G\) in which each vertex is adjacent to every vertex of some color class. The total dominator chromatic number \(\chi_{d}^{t}(G)\) of \(G\) is the minimum number of colors among all total dominator colorings of \(G\). A total dominating set of \(G\) is a set \(S\)
openaire +2 more sources