Results 201 to 210 of about 8,782,249 (234)

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

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   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Paired-Domination Subdivision Numbers of Graphs

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyed Mahmoud Sheikholeslami, H Karami, O Favaron   +2 more
exaly   +4 more sources

A proof of a conjecture on the paired-domination subdivision number

Graphs and Combinatorics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mustapha Chellali, Rana Khoeilar, Zehui Shao   +2 more
exaly   +3 more sources

Disproof of a Conjecture on the Subdivision Domination Number of a Graph

Graphs and Combinatorics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seyed Mahmoud Sheikholeslami, H Karami, O Favaron   +2 more
exaly   +3 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.
Rana Khoeilar, Seyed Mahmoud Sheikholeslami, H Karami   +2 more
exaly   +2 more sources

Disprove of a Conjecture on the Doubly Connected Domination Subdivision Number

Bulletin of the Iranian Mathematical Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Kosari, Zehui Shao, Seyed Mahmoud Sheikholeslami   +2 more
exaly   +3 more sources

Roman domination subdivision number of graphs

Aequationes Mathematicae, 2009
A Roman dominating function on a graph G = (V, E) is a function $$f : V \rightarrow \{0, 1, 2\}$$ satisfying the condition that every vertex v for which f(v) = 0 is adjacent to at least one vertex u for which f(u) = 2. The weight of a Roman dominating function is
Seyed Mahmoud Sheikholeslami
exaly   +2 more sources