Results 231 to 240 of about 313,249 (265)

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

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

Genome-wide chromatin accessibility and selective signals of meat rabbits reveal key Cis-regulatory elements and variants during postnatal development of skeletal muscles in rabbits. [PDF]

BMC Genomics
Du K, Wang DH, Hu SQ, Xia Y, Wu Q, Gu MQ, Chen XW.   +6 more
europepmc   +1 more source

Theoretical modelling of efficient fire safety water networks by certified domination. [PDF]

Sci Rep
Raczek J, Miotk M.
europepmc   +1 more source

A framework for spontaneous Brillouin noise: unveiling fundamental limits in Brillouin metrology. [PDF]

Light Sci Appl
Jin S, Yao S, Yang Z, Du Z, Hong X, Soto MA, Xie J, Zhang L, Yang F, Wu J.   +9 more
europepmc   +1 more source

Are We Ignoring the Hardship of Nurses: Occupational Stress Experienced by Nurses, a Mixed-method Enquiry from India.

Indian J Occup Environ Med
Joseph HB, Ravindran V.
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:

Graphs with large total domination number

Journal of Graph Theory, 2000
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if each vertex of \(G\) is adjacent to a vertex of \(S\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
openaire   +4 more sources

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

Disjunctive Total Domination Subdivision Number of Graphs

Fundamenta Informaticae, 2020
A set S ⊆ V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number is the minimum cardinality of a disjunctive total dominating set in G. We define the disjunctive total domination subdivision number of G as the minimum number of
Ciftci, Canan, Aytac, Vecdi
openaire   +3 more sources