Results 71 to 80 of about 12,767 (290)
Signed total domination number of a graph [PDF]
, 2001 summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
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
Total domination subdivision numbers of graphs
Discussiones Mathematicae Graph Theory, 2004 Summary: A set \(S\) of vertices in a graph \(G=(V,E)\) is a total dominating set of \(G\) if every vertex of \(V\) is adjacent to a vertex in \(S\). The total domination number of \(G\) is the minimum cardinality of a total dominating set of \(G\). The total domination subdivision number of \(G\) is the minimum number of edges that must be subdivided (
Teresa W. Haynes +2 more
openaire +2 more sources
On graphs with equal total domination and connected domination numbers
Applied Mathematics Letters, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The ubiquitin ligase RNF115 is required for the clearance of damaged lysosomes
FEBS Letters, EarlyView.Upon lysosomal rupture, an E3 ubiquitin ligase RNF115 translocates from the cytosol to the damaged lysosomal membrane. Moreover, RNF115 depletion impairs the clearance of damaged lysosomes, identifying it as a key regulator of lysosomal quality control.
Sae Nakanaga +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
The human gut microbiome across the life course
FEBS Letters, EarlyView.Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
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
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 +4 more
wiley +1 more source
Domination number of total graphs
, 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