Results 71 to 80 of about 368,338 (322)
On the Total Outer k-Independent Domination Number of Graphs
Mathematics, 2020 A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Abel Cabrera-Martínez +3 more
doaj +1 more source
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
On a Class of Graphs with Large Total Domination Number
, 2018 Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Bahadır, Selim, Gözüpek, Didem
core +1 more source
Real‐time assay of ribonucleotide reductase activity with a fluorescent RNA aptamer
FEBS Letters, EarlyView.Ribonucleotide reductases (RNR) synthesize DNA building blocks de novo, making them crucial in DNA replication and drug targeting. FLARE introduces the first single‐tube real‐time coupled RNR assay, which enables isothermal tracking of RNR activity at nanomolar enzyme levels and allows the reconstruction of allosteric regulatory patterns and rapid ...
Jacopo De Capitani +4 more
wiley +1 more source
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
On Total Domination in the Cartesian Product of Graphs
Discussiones Mathematicae Graph Theory, 2018 Ho proved in [A note on the total domination number, Util. Math. 77 (2008) 97–100] that the total domination number of the Cartesian product of any two graphs without isolated vertices is at least one half of the product of their total domination numbers.
Brešar Boštjan +3 more
doaj +1 more source
On the total domination number of total graphs
Discussiones Mathematicae Graph TheorySummary: Let \(G\) be a graph with no isolated vertex. A set \(D\subseteq V(G)\) is a total dominating set of \(G\) if every vertex of \(G\) is adjacent to at least one vertex in \(D\). The total domination number of \(G\), denoted by \(\gamma_t(G)\), is the minimum cardinality among all total dominating sets of \(G\).
Abel Cabrera-Martínez +2 more
doaj +4 more sources
Total domination numbers of cartesian products [PDF]
, 2004 Let G□H denote the cartesian product of graphs G and H.
A. Klobučar
core +1 more source
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 +3 more
wiley +1 more source
The complexity of connected domination and total domination by restricted induced graphs [PDF]
, 2010 Given a graph class C, it is natural to ask whether a given graph has a connected or a total dominating set inducing a graph of C and, if so, what is the minimal size of such a set.
Schaudt, Oliver, Schrader, Rainer
core