Results 61 to 70 of about 313,249 (265)
Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]
, 2014 Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G.
Beverly, Joshua +3 more
core
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Total dominator chromatic number of a graph [PDF]
Transactions on Combinatorics, 2015 Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes.
Adel P. Kazemi
doaj
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 +4 more
wiley +1 more source
Himpunan Dominasi Ganda Pada Graf Korona Dan Graf Produk Leksikografi Dua Buah Graf [PDF]
, 2016 ABSTARCT. Let be a subset of , with is a graph without isolated vertices. A subset of referred to double domination in if every vertex , such that every vertex in minimal adjacent with two element of .
Maulana, F. (Fikri)
core
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
Domination parameters of a graph with added vertex [PDF]
Opuscula Mathematica, 2004 Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with \(xy\in E\).
Maciej Zwierzchowski
doaj
Bounds on the Locating-Total Domination Number in Trees
Discussiones Mathematicae Graph Theory, 2020 Given a graph G = (V, E) with no isolated vertex, a subset S of V is called a total dominating set of G if every vertex in V has a neighbor in S. A total dominating set S is called a locating-total dominating set if for each pair of distinct vertices u ...
Wang Kun, Ning Wenjie, Lu Mei
doaj +1 more source
The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs [PDF]
, 2014 Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\gamma(G)$, is the smallest cardinality of a dominating set of $G$.
Hu, Fu-Tao, Sohn, Moo Young
core
FEBS Letters, EarlyView.Mitochondrial remodeling shapes neural and glial lineage progression by matching metabolic supply with demand. Elevated OXPHOS supports differentiation and myelin formation, while myelin compaction lowers mitochondrial dependence, revealing mitochondria as key drivers of developmental energy adaptation.
Sahitya Ranjan Biswas +3 more
wiley +1 more source