Results 241 to 250 of about 368,632 (278)

Understanding the Lived Experiences of the members of the Society for the Advancement of Biology Education Research through Collins' Matrix of Domination Framework. [PDF]

CBE Life Sci Educ
Chasen A, Scheuermann NL, Balser T, Chouvalova A, Coffman C, Conner A, Cruz A, Eden A, Erdmann RM, Foster-Hartnett D, Gerstner B, Ishikawa C, Liepkalns J, Metzger KJ, Segura M, Smith-Keiling BL, Williams EL, Wright AM, Caporale N.   +18 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

Lipoxygenase Inhibitory Activity and Prostate Cancer Cytotoxicity of In Situ- and In Vitro-Cultivated Balkan Endemic <i>Sideritis scardica</i> Griseb. [PDF]

Plants (Basel)
Danova K, Petreska Stanoeva J, Stoyanova E, Alipieva K, Stefova M, Aneva I.   +5 more
europepmc   +1 more source

The Association between Self-Reported Self-Disturbance Phenomena and Personal Recovery in Patients with a Schizophrenia Spectrum Disorder, Siblings, and Controls.

Psychopathology
Jelsma A, Dijkstra S, Wiemer S, Vellinga A, de Koning M, Cahn W, Simons C, van der Pluijm M, de Haan L.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Total edge–vertex domination

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

Roman and Total Domination

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, Haynes, Teresa W., Hedetniemi, Stephen T.   +2 more
openaire   +3 more sources

Total Domination Game

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, Michael A. Henning, Sandi Klavžar, Douglas F. Rall   +3 more
openaire   +1 more source

Total Dominator Colorings and Total Domination in Graphs

Graphs and Combinatorics, 2014
Given 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

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs

Graphs and Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balbuena, Camino, Hansberg, Adriana, Haynes, Teresa W., Henning, Michael A.   +3 more
openaire   +2 more sources