Results 211 to 220 of about 460,855 (251)

Explainable graph learning for multimodal single-cell data integration. [PDF]

BMC Bioinformatics
Koca MB, Sevilgen FE.
europepmc   +1 more source

Critical Pragmatism as a Paradigm for Nursing Research. [PDF]

Nurs Inq
Gordon R, Kekanovich M, Zuk A, Luctkar-Flude M, Macdonald D.   +4 more
europepmc   +1 more source

Looking Back With Logos the Cat: Unsettling the Gaze in Multispecies Research. [PDF]

Qual Inq
Linares-Roake J, Cudworth E, Van Patter L, Rice C, Breen AV.   +4 more
europepmc   +1 more source

Transposable elements are driving rapid adaptation of Enterococcus faecium. [PDF]

Nature
Grieshop MP, Behr AA, Bowden S, Lin JD, Molari M, Reynolds GZ, Brooks EF, Doyle B, Moore AA, Rodriguez-Nava G, Salinas JL, Banaei N, Bhatt AS.   +12 more
europepmc   +1 more source

Large Language Models Utility for Rapid On-Site Evaluation in Interventional Pulmonology. [PDF]

Diagnostics (Basel)
Flaschner M, Kramer MR, Krolik A, Gershman E, Tovar A, Rosengarten D, Amor SM, Pertzov B, Heching M, Shtraichman O, Freidkin L.   +10 more
europepmc   +1 more source

Justice and responsibility in climate change adaptation research. [PDF]

Bull World Health Organ
Ferguson K, Atuire CA, McDermid SS, Vedanthan R.   +3 more
europepmc   +1 more source

Immune reprogramming following B-cell depletion in MS involves NF-κB activation and durable suppression of EBV host-pathogen interaction

Cucuzza CS, Li G, Dethlefsen O, Byskata K, Bort-Brusca J, Li M, Guala D, Sorini C, Ewing E, D'Orso S, Thomas O, Rykaczewska U, Gromadzka A, Kakhki MP, Reinsbach S, Björklund Å, Khademi M, Olsson T, Needhamsen M, Jagodic M, Ruffin N, Piehl F.   +21 more
europepmc   +1 more source

Paired-domination in graphs

Networks, 1998
Summary: In a graph \(G= (V,E)\) if we think of each vertex \(s\) as the possible location for a guard capable of protection each vertex in its closed neighborhood \(N[s]\), then ``domination'' requires every vertex to be protected. Thus, \(S\subset V(G)\) is a dominating set if \(\bigcup_{s\in s}N[s]= V(G)\).
Haynes, Teresa W., Slater, Peter J.
openaire   +4 more sources

Paired Domination in Graphs

, 2020
A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number of G.
Desormeaux, Wyatt J., Haynes, Teresa W., Henning, Michael A.   +2 more
openaire   +3 more sources

Induced-paired domination in graphs.

Ars Comb., 2000
A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). If moreover the subset \(\langle S\rangle \) of \(G\) induced by \(S\) consists of independent edges, then \(S\) is an induced-paired dominating set in \(G\).
Studer, Daniel S., Haynes, Teresa W., Lawson, Linda M.   +2 more
core   +4 more sources