Results 161 to 170 of about 530 (196)

Integrating intestinal microbiome and urinary metabolome data to predict secondary infection in critically ill patients. [PDF]

Crit Care
Linz C, Tsenova K, Dettmer K, Ellmann L, Oefner PJ, Gronwald W, Farowski F, Rüb AM, Freedberg DE, Koehler P, Borrega JG, Naendrup JH, Vehreschild MJGT, Böll B.   +13 more
europepmc   +1 more source

Physicochemical and microbial community dynamics of Kocho fermented from different enset varieties in South West Ethiopia. [PDF]

Heliyon
Tadesse M, Ajibade FO, Minale M, Mekonnen A, Guadie A.   +4 more
europepmc   +1 more source

Leveraging the subgenus category to address genus over-splitting exemplified with Prescottella and other recently proposed Mycobacteriales genera

Val-Calvo J, Scortti M, Vázquez-Boland JA.   +2 more
europepmc   +1 more source

Large-scale comparative analysis reveals top graph signal processing features for subject identification

Bolton TAW, Schöttner M, Patel J, Fluhr H, Alemán-Gómez Y, Hagmann P.   +5 more
europepmc   +1 more source

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

Results on Total Restrained Domination Number and Subdivision Number for Certain Graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2015
AbstractIn this paper we determine the total restrained domination number and subdivision number for andrasfai graph, chvatal graph, wheel graph, windmill graph and strong product graph.
Bijan Davvaz, Pon Jeyanthi
exaly   +2 more sources

A New Bound on the Total Domination Subdivision Number

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Hossein Karami 0002, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +1 more source

Game total domination subdivision number of a graph

Discrete Mathematics, Algorithms and Applications, 2015
A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination numberγt(G) is the minimum cardinality of a total dominating set of G. The game total domination subdivision number of a graph G is defined by the following game. Two players 𝒟 and 𝒜,
Jafar Amjadi, Hossein Karami 0002, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +2 more sources

TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Odile Favaron, Rana Khoeilar, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +3 more sources

An Upper Bound for the Total Domination Subdivision Number of a Graph

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Karami 0002, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar   +3 more
openaire   +1 more source