Results 281 to 290 of about 366,581 (319)
Microbiome-based prediction of allogeneic hematopoietic stem cell transplantation outcome. [PDF]
Genome MedShtossel O +14 more
europepmc +1 more source
Total Dominating Sets and Total Domination Polynomials of Square Of Wheels
IOSR Journal of Mathematics, 2014 openaire +1 more source
It is time to acknowledge and act on the importance of power in integrated knowledge translation. [PDF]
Health Res Policy SystKothari A +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
RAIRO - Theoretical Informatics and Applications, 2020
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A subset D ⊆ E is an edge-vertex dominating set (in simply, ev-dominating set) of G, if every vertex of a graph G is ev-dominated by at least one edge of D.
Sahin, Abdulgani, Sahin, Bunyamin
openaire +4 more sources
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A subset D ⊆ E is an edge-vertex dominating set (in simply, ev-dominating set) of G, if every vertex of a graph G is ev-dominated by at least one edge of D.
Sahin, Abdulgani, Sahin, Bunyamin
openaire +4 more sources
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
2021
Total domination is the second most studied topic in domination theory, and thus the total domination game is a natural variation of the domination game. It was introduced and first studied in 2015 by Henning, Klavžar, and Rall. There are, of course, some similarities between these two kinds of domination games, but it was shown in this introductory ...
Boštjan Brešar +3 more
openaire +1 more source
Total domination is the second most studied topic in domination theory, and thus the total domination game is a natural variation of the domination game. It was introduced and first studied in 2015 by Henning, Klavžar, and Rall. There are, of course, some similarities between these two kinds of domination games, but it was shown in this introductory ...
Boštjan Brešar +3 more
openaire +1 more source
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 +1 more source