Results 31 to 40 of about 9,482,744 (249)
, 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).
Haynes, Teresa W. +5 more
core +1 more source
Distance paired domination numbers of graphs
Discrete Mathematics, 2008 Let \(G=(V,E)\) be a graph without an isolated vertex. A set \(D\subset V(G)\) is a dominating set of \(G\) if every vertex in \(V(G)-D\) is adjacent to at least one vertex in \(D\). A set \(D\subset V(G)\) is a paired dominating set of \(G\) if it is dominating and the indiced subgraph \(\) has a perfect matching.
openaire +3 more sources
Graphs with maximum size and given paired-domination number
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning +2 more
openaire +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Γ -Paired dominating graphs of some paths
MATEC Web of Conferences, 2018 A paired dominating set of a graph G = (V(G),E(G)) is a set D of vertices of G such that every vertex is adjacent to some vertex in D, and the subgraph of G induced by D contains a perfect matching. The upper paired domination number of G, denoted by Γpr(
Eakawinrujee Pannawat +1 more
doaj +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
FEBS Letters, EarlyView.Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta +3 more
wiley +1 more source
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Trees With Large Paired-Domination Number
, 2006 A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is bounded above by twice the domination number of G.
Haynes, Teresa, Henning, Michael A.
core +1 more source