Results 121 to 130 of about 14,893,384 (293)
Some results on total domination in direct products of graphs [PDF]
, 2006 International audienceUpper and lower bounds on the total domination number of the direct product of graphs are given. The bounds involve the {2}-total domination number, the total 2-tuple domination number, and the open packing number of the factors ...
Paul Dorbec +7 more
core +1 more source
Neutralization of the PTX3/CD44 axis suppresses TGF‐β1 signaling in kidney fibrosis
FEBS Letters, EarlyView.This study investigates how the PTX3/CD44 axis promotes kidney fibrosis by activating TGF‐β1 signaling. We demonstrate that the neutralizing antibody WHC‐001 effectively inhibits this pathway, suppressing myofibroblast activation and partial epithelial–mesenchymal transition (EMT).
Chao‐Chun Cheng +8 more
wiley +1 more source
Inhibition of dipeptidyl peptidase 7 impairs lysophagy in LLOMe‐treated HepG2 cells
FEBS Letters, EarlyView.DPP7 inhibition delays ubiquitin‐dependent lysophagy by attenuating ubiquitin accumulation and the recruitment of SQSTM1 and LC3 to damaged lysosomes, resulting in delayed clearance of damaged lysosomes and impaired restoration of lysosomal homeostasis. Created using FigureLabs (Certificate ID: FL‐PUB‐20260922‐Z99XNX).
Na Yeon Park +8 more
wiley +1 more source
Upper Bounds on the Total Domination Number
, 2009 A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G.
Haynes, Teresa W., Henning, Michael A.
core
Total Domination Cover Rubbling
, 2020 Let G be a connected simple graph with vertex set V and a distribution of pebbles on the vertices of V. The total domination cover rubbling number of G is the minimum number of pebbles, so that no matter how they are distributed, it is possible that ...
Haynes, Teresa W. +3 more
core +1 more source
Lower Bounds for the Total Distance $k$-Domination Number of a Graph
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself.
Randy R. Davila, Davila, Randy R
core +2 more sources
FEBS Letters, EarlyView.Vacuolar H+‐ATPase (V‐ATPase) is a multisubunit rotary proton pump that acidifies intracellular compartments. Using elastic network models, we identified conserved hinge residues that govern its large‐scale functional motions. We show that intrinsically encoded ‘soft modes’ drive critical functional transitions, including rotary catalysis and ...
Diksha Parwana +3 more
wiley +1 more source
On graphs for which the connected domination number is at most the total domination number
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Comparing the paths of Hedgehog release in artificial and natural settings
FEBS Letters, EarlyView.Hh morphogens require solubilization factors to overcome their tight association with the plasma membrane and signal to distant cells, but the precise functions of these factors are controversial. Here, we use published in vivo observations as the most relevant evidence to test their suggested functions and discuss contradictions and gaps between in ...
Janna Puschmann, Kay Grobe
wiley +1 more source
Upper Bounds on the Total Domination Number
, 2008 A total dominating set of a graph G with no isolated vertex is a set S of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G.
Haynes, Teresa W. +3 more
core