Results 221 to 230 of about 460,858 (257)

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

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

Some of the next articles are maybe not open access.

Related searches:

Paired-domination game played on cycles

Discrete Applied Mathematics, 2023
This text further develops the graph domination game introduced in [\textit{B. Brešar} et al. SIAM J. Discrete Math. 24, No. 3, 979--991 (2010; Zbl 1223.05189)]. The version of the game studied involves two players, the Dominator and the Staller, who take turns choosing pairs of adjacent, unchosen vertices that dominate at least one vertex not ...
Michael Henning
exaly   +4 more sources

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

Paired-Domination in Subdivided Star-Free Graphs

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Dorbec, Sylvain Gravier
openaire   +3 more sources

The Outer-Paired Domination of Graphs

International Journal of Foundations of Computer Science, 2022
In this paper, we introduce a new variant of domination called the outer-paired domination. For a graph [Formula: see text], an outer-paired dominating set [Formula: see text] is a dominating set of [Formula: see text] such that the induced subgraph of [Formula: see text] contains a perfect matching.
Chih-Yuan Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen, Chiun-Chieh Hsu   +4 more
openaire   +2 more sources

Upper total domination versus upper paired-domination

Quaestiones Mathematicae, 2007
Let G be a graph with no isolated vertices. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S, while a paired-dominating set of G is a dominating set of vertices whose induced subgraph has a ...
Michael Henning, Paul Dorbec
exaly   +1 more source