Results 51 to 60 of about 41,065 (264)
Locating and total dominating sets in trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haynes, Teresa W. +2 more
openaire +2 more sources
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
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
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
Total 2-Rainbow Domination Numbers of Trees
A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(G)) is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that for every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is fulfilled ...
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
Acyclic total dominating sets in cubic graphs
We show that every cubic graph has a total dominating set D such that the subgraph induced by D is acyclic. As a consequence, an old result attributed to Berge follows.
Goddard, Wayne, Henning, Michael A.
openaire +2 more sources
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
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 Versus Paired-Domination in Regular Graphs
A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna +4 more
doaj +1 more source
A characterization of graphs with disjoint total dominating sets
Summary: A set \(S\) of vertices in a graph \(G\) is a total dominating set of \(G\) if every vertex is adjacent to a vertex in \(S\). A fundamental problem in total domination theory in graphs is to determine which graphs have two disjoint total dominating sets.
Henning, Michael A., Peterin, Iztok
openaire +4 more sources
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture [PDF]
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. A locating-total dominating set of $G$ is a total dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v ...
Foucaud, Florent, Henning, Michael A.
openaire +4 more sources
The problems of determining locating-dominating, open locating-dominating or locating total-dominating sets of minimum cardinality in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for general graphs.
Gabriela Argiroffo +3 more
openaire +3 more sources

