Results 91 to 100 of about 14,233,339 (289)

Domination number of total graphs

open access: yes, 2016
Let R be a commutative ring with Z(R) the set of zero-divisors and U(R) the set of unit elements of R. The total graph of R, denoted by T(Γ(R)), is the (undirected) graph with all elements of R as vertices, and for distinct x, y ∈ R, the vertices x and y
Siamak Yassemi   +5 more
core   +1 more source

Degradation mechanism of the von Willebrand factor A2 domain by nattokinase

open access: yesFEBS Letters, EarlyView.
Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto   +3 more
wiley   +1 more source

On the total domination number of cross products of graphs

open access: yesDiscrete Mathematics, 2008
We give lower and upper bounds on the total domination number of the cross product of two graphs, γ t(G×H). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles. We determine the exact values of γ t(G×Pn) and γ
Gravier, Sylvain   +2 more
openaire   +5 more sources

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS 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

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

open access: yesFEBS Letters, EarlyView.
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa   +2 more
wiley   +1 more source

On the total domination number of graphs [PDF]

open access: yes, 2003
A total dominating set in a graph G is a subset A of vertices such that every vertex in G is adjacent to a vertex in A. The total domination number of a graph G is defined as the cardinality of the smallest total dominating set. Some results on the total
Wei, Bing
core   +1 more source

Perfectly relating the domination, total domination, and paired domination numbers of a graph

open access: yesDiscrete Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José D. Alvarado   +2 more
openaire   +3 more sources

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS 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

Bounds on the 2-domination number in cactus graphs [PDF]

open access: yesOpuscula Mathematica, 2006
A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at least twice. The minimum cardinality of a \(2\)-dominating set of \(G\) is the \(2\)-domination number \(\gamma_{2}(G)\).
Mustapha Chellali
doaj  

Total Roman Reinforcement in Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Ahangar H. Abdollahzadeh   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy