Results 91 to 100 of about 14,893,384 (293)
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
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Edge domination in graphs of cubes [PDF]
, 2002 summary:The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number.
Zelinka, Bohdan +3 more
core +1 more source
Perfectly relating the domination, total domination, and paired domination numbers of a graph
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José D. Alvarado +2 more
openaire +3 more sources
The microbiome in human skin aging
FEBS Letters, EarlyView.Age‐related skin changes encompass the well‐known visible phenotypic alterations, together with microbiome dysbiosis and a series of molecular aging hallmarks. These hallmarks characterize not only a fully stablished aged phenotype but also the skin aging process itself.
Manuel Huerta Arana +3 more
wiley +1 more source
On the total domination number of graphs [PDF]
, 2003 A total dominating set in a graph G is a subset A of vertices such that every vertex in G is adjacent to a vertex in A. The total domination number of a graph G is defined as the cardinality of the smallest total dominating set. Some results on the total
Wei, Bing
core
Total Outer-Independent Domination Number: Bounds and Algorithms
AlgorithmsIn graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph G(V,E); a subset of its vertices is a total dominating set (TDS) if, for each x∈V(G), there exists an
Paul Bosch +3 more
doaj +1 more source
Bounds on the 2-domination number in cactus graphs [PDF]
Opuscula Mathematica, 2006 A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at least twice. The minimum cardinality of a \(2\)-dominating set of \(G\) is the \(2\)-domination number \(\gamma_{2}(G)\).
Mustapha Chellali
doaj
Total Roman Reinforcement in Graphs
Discussiones Mathematicae Graph Theory, 2019 A total Roman dominating function on a graph G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2 and the subgraph of G induced by the set of all vertices of positive weight has no isolated vertex.
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
FEBS Letters, EarlyView.This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee +2 more
wiley +1 more source