Results 61 to 70 of about 8,369 (289)

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

Discrete 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   +3 more sources

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

FEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe, Tanmay Kumar Mohanty, Rashna Bhandari, Dorothea Fiedler   +3 more
wiley   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

FEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy, Trina Dykstra‐MacPherson, Mathias A. Bell, Peter L. Davies, Ruby May A. Sullan   +4 more
wiley   +1 more source

Diversity and complexity in neural organoids

FEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Independent domination in graphs [PDF]

, 2018
V magistrskem delu obravnavamo različne tipe dominacij in sicer dominantno število, neodvisnostno število, neodvisno dominantno število in zgornje dominantno število.
Črešnjevec, Nina
core   +1 more source

Independent and total domination in antiprism graphs from convex polytopes

Mathematics 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, R. Arasu, N. Parvathi, K. Marimuthu, Muhammad Imran Qureshi, Hafiz Muhammad Afzal Siddiqui, Aseel Smerat   +6 more
doaj   +1 more source

Domination Number in Neutrosophic Soft Graphs [PDF]

Neutrosophic 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, R. Jahir Hussain, F. Smarandache   +2 more
doaj   +1 more source

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

FEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai, Mohyeddine Omrane, Nassima Benzoubir, Didier Samuel, Ama Gassama‐Diagne   +4 more
wiley   +1 more source

Improved Upper Bound on Independent Domination Number for Hypercubes [PDF]

, 2022
We revisit the problem of determining the independent domination number in hypercubes for which the known upper bound is still not tight for general dimensions. We present here a constructive method to build an independent dominating set $S_n$ for the $n$
Chowdhury, Debabani, Bhattacharya, Bhargab B., Das, Debesh K.   +2 more
core   +1 more source

Bounds on Co-Independent Liar’s Domination in Graphs

Journal 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, S. Amutha, N. Anbazhagan, Ismail Naci Cangul   +3 more
doaj   +1 more source