Intersectionality, racism, and mental health of migrants arriving at borders in Latin America: a qualitative study based on in-depth interviews with key informants of the cases of Ecuador and Chile. [PDF]
Rocha-Jiménez T +4 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]
Graeber E +6 more
europepmc +1 more source
Related searches:
A Proof of a Conjecture on the Connected Domination Number
Bulletin of the Malaysian Mathematical Sciences Society, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Kosari +2 more
exaly +3 more sources
On graphs for which the connected domination number is at most the total domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oliver Schaudt
exaly +3 more sources
Bounds on the connected domination number of a graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wyatt J Désormeaux +2 more
exaly +4 more sources
On graphs with equal total domination and connected domination numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue-Gang Chen
exaly +2 more sources
Characterization of graphs with equal domination and connected domination numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue-Gang Chen
exaly +3 more sources
Total outer-connected domination numbers of trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joanna Cyman, Joanna Raczek
exaly +2 more sources
A note on connected domination number and leaf number
Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Phillip Mafuta +2 more
openaire +1 more source
The connected hub number and the connected domination number
Networks, 2011AbstractThe connected hub number hc(G) of a connected graph G is the smallest order of a connected subgraph H of G such that any two nonadjacent vertices of G − H are joined in G by a path with all internal vertices in H. Letting γc(G) denote the connected domination number of G, it is easy to see that hc(G) ≤ γc(G) ≤ hc(G) + 1 for every connected ...
Peter D. Johnson Jr. +2 more
openaire +1 more source

