Results 301 to 310 of about 9,635,811 (355)

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

Domination and power domination in a one-pentagonal carbon nanocone structure. [PDF]

Front Chem
Pandian S, N M.
europepmc   +1 more source

Perspectives of health, and human and social sciences professionals on student transformation regarding racial discrimination in healthcare. [PDF]

BMC Med Educ
Lambert M, Mansouri M, Mouhab A, Radjack R, Moro MR.   +4 more
europepmc   +1 more source

The freedom to forget. [PDF]

Dialogues Hum Geogr
Hepach MG.
europepmc   +1 more source

Some novel concepts of intuitionistic fuzzy directed graphs with application in selecting a suitable place for opening restaurant. [PDF]

Heliyon
Khan WA, Ali K, Fida A, Asif M, Pham HV, Nguyen QH, Le TT, Tran LPT.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Trees with Equal Domination and Restrained Domination Numbers

Journal of Global Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dankelmann, Peter, Hattingh, Johannes H., Henning, Michael A., Swart, Henda C.   +3 more
openaire   +1 more source

Split domination number of divisible dominating graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2020
A graph G is a divisible dominating graph if the vertices are labeled with positive integers d and n except 0, such that the vertex labeled with n is adjacent to the vertex named with d if and only...
S. Amutha, K. Suriya Prabha, N. Anbazhagan, P. Shanthi   +3 more
openaire   +1 more source

On trees with domination number equal to edge-vertex roman domination number

Discrete Mathematics, Algorithms and Applications, 2020
An edge-vertex Roman dominating function (or just ev-RDF) of a graph [Formula: see text] is a function [Formula: see text] such that for each vertex [Formula: see text] either [Formula: see text] where [Formula: see text] is incident with [Formula: see text] or there exists an edge [Formula: see text] adjacent to [Formula: see text] such that [Formula:
Naresh Kumar, H., Venkatakrishnan, Y. B.
openaire   +2 more sources

The Sierpiński domination number

Ars Mathematica Contemporanea
Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$, consisting of $|V(G)|$ copies of $H$; for every edge $gg'$ of $G$ there is an edge between copies $gH$ and $g'H$ of $H ...
Henning, Michael A., Klavžar, Sandi, Kleszcz, Elżbieta, Pilśniak, Monika   +3 more
openaire   +2 more sources