Results 81 to 90 of about 1,521,521 (318)
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
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
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
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
Locating and Total Dominating Sets of Direct Products of Complete Graphs [PDF]
, 2011 A set S of vertices in a graph G = (V,E) is a metric-locating-total dominating set of G if every vertex of V is adjacent to a vertex in S and for every u ≠ v in V there is a vertex x in S such that d(u,x) ≠ d(v,x).
Iswadi, Hazrul
core
On total domination subdivision numbers of trees
Discussiones Mathematicae Graph Theory15 pages, 7 ...
Michael A. Henning, Jerzy Topp
openaire +2 more sources
Total restrained domination numbers of trees
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raczek, Joanna, Cyman, Joanna
openaire +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
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
Total domination subdivision numbers of trees
Discrete Mathematics, 2004 The total domination subdivision number \(\text{ sd}_{\gamma_t}(G)\) of a graph \(G\) is the minimum number of edges whose subdivision increases the total domination number \({\gamma_t}(G)\) of \(G\). \textit{T. W. Haynes} et al. [J. Comb. Math. Comb. Comput.
Haynes, Teresa W. +2 more
openaire +3 more sources