Results 171 to 180 of about 13,369 (211)

An enterococcal phage-derived enzyme suppresses graft-versus-host disease. [PDF]

Nature
Fujimoto K, Hayashi T, Yamamoto M, Sato N, Shimohigoshi M, Miyaoka D, Yokota C, Watanabe M, Hisaki Y, Kamei Y, Yokoyama Y, Yabuno T, Hirose A, Nakamae M, Nakamae H, Uematsu M, Sato S, Yamaguchi K, Furukawa Y, Akeda Y, Hino M, Imoto S, Uematsu S.   +22 more
europepmc   +1 more source

Shallow shotgun metagenomic sequencing of vaginal microbiomes with the Oxford Nanopore technology enables the reliable determination of vaginal community state types and broad community structures. [PDF]

BMC Microbiol
Graeber E, Tysha A, Nisar A, Wind D, Mendling W, Finzer P, Dilthey A.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Domination and Total Domination in Hypergraphs

2020
A dominating set in a hypergraph H with vertex set V (H) and E(H) is a subset of vertices D ⊆ V (H) such that for every vertex v ∈ V (H) ∖ D, there exists an edge e ∈ E(H) for which v ∈ e and e ∩ D≠∅. A total dominating set in H is a dominating set D of H with the additional property that for every vertex v in D, there exists an edge e ∈ E(H) for which
Henning, Michael A., Yeo, Anders
openaire   +3 more sources

Domination and total domination in complementary prisms [PDF]

Journal of Combinatorial Optimization, 2008
Let G be a graph and ${\overline {G}}$ be the complement of G. The complementary prism $G{\overline {G}}$ of G is the graph formed from the disjoint union of G and
Haynes, Teresa W., Henning, Michael A., Van Der Merwe, Lucas C.   +2 more
openaire   +2 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 in graphs

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, R. M. Dawes, Stephen T. Hedetniemi   +2 more
openaire   +3 more sources

Total Dominator Colorings and Total Domination in Graphs

Graphs and Combinatorics, 2014
A total dominator coloring of a graph $$G$$G is a proper coloring of the vertices of $$G$$G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number $$\chi _d^t(G)$$?dt(G) of $$G$$G is the minimum number of colors among all total dominator coloring of $$G$$G.
openaire   +2 more sources