Results 71 to 80 of about 11,106,432 (291)

Product throttling for power domination [PDF]

open access: yes, 2023
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann   +6 more
core  

A note on cops and robbers, independence number, domination number and diameter

open access: yesDiscrete Mathematics, 2023
We study relations between diameter $D(G)$, domination number $γ(G)$, independence number $α(G)$ and cop number $c(G)$ of a connected graph $G$, showing (i.) $c(G) \leq α(G)-\lfloor \frac{D(G)-3}{2} \rfloor$, and (ii.) $c(G) \leq γ(G) - \frac{D(G)}{3} + O (\sqrt{D(G)})$.
Jan Petr, Julien Portier, Leo Versteegen
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

Independent and total domination in antiprism graphs from convex polytopes

open access: yesMathematics Open
Let [Formula: see text] be a connected graph. Antiprism graphs, defined as the skeletons of antiprism-shaped convex polytopes, consist of [Formula: see text] vertices and [Formula: see text] edges for an n-sided base.
Nasir Ali   +6 more
doaj   +1 more source

Domination Number in Neutrosophic Soft Graphs [PDF]

open access: yesNeutrosophic Sets and Systems, 2019
The soft set theory is a mathematical tool to represent uncertainty, imprecise, and vagueness is often employed in solving decision making problem.
S. Satham Hussain   +2 more
doaj   +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

Bounds on Co-Independent Liar’s Domination in Graphs

open access: yesJournal of Mathematics, 2021
A set S⊆V of a graph G=V,E is called a co-independent liar’s dominating set of G if (i) for all v∈V, NGv∩S≥2, (ii) for every pair u,v∈V of distinct vertices, NGu∪NGv∩S≥3, and (iii) the induced subgraph of G on V−S has no edge.
K. Suriya Prabha   +3 more
doaj   +1 more source

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

Distances and Domination in Graphs [PDF]

open access: yes, 2020
This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of ...

core   +1 more source

Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers [PDF]

open access: yesTransactions on Combinatorics, 2015
A 2-emph{rainbow dominating function} (2RDF) on a graph $G=(V, E)$ is a function $f$ from the vertex set $V$ to the set of all subsets of the set ${1,2}$ such that for any vertex $vin V$ with $f(v)=emptyset$ the condition $bigcup_{uin N(v)}f(u)={1,2}$
J. Amjadi   +3 more
doaj  

Home - About - Disclaimer - Privacy