Results 61 to 70 of about 422,220 (274)
The bondage number of random graphs [PDF]
A dominating set of a graph is a subset $D$ of its vertices such that every vertex not in $D$ is adjacent to at least one member of $D$. The domination number of a graph $G$ is the number of vertices in a smallest dominating set of $G$.
Mitsche, Dieter +2 more
core +2 more sources
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
The domination number and the least $Q$-eigenvalue [PDF]
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang +3 more
core
Graphs with large semipared domination number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haynes, Teresa W., Henning, Michael A.
openaire +3 more sources
Trees with vertex-edge Roman Domination number twice the domination number minus one
A vertex-edge Roman dominating function (or just ve-RDF) of a graph G = (V, E) is a function f : V (G) → {0, 1, 2} such that for each edge e = uv either max{f (u), f (v)} ≠ 0 or there exists a vertex w such that either wu ∈ E or wv ∈ E and f (w) = 2. The weight of a ve-RDF is the sum of its function values over all vertices.
H. Naresh Kumar, Y. B. Venkatakrishnan
openaire +3 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
On a Vizing-type Integer Domination Conjecture
Given a simple graph G, a dominating set in G is a set of vertices S such that every vertex not in S has a neighbor in S. Denote the domination number, which is the size of any minimum dominating set of G, by γ(G). For any integer k ≥ 1, a function f : V
Elliot Krop, Randy Davila
doaj +1 more source
Time after time – circadian clocks through the lens of oscillator theory
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
Equalityof Secure Domination and Inverse Secure Domination Numbers
Summary: Let \(G=(V,E)\) be a graph. Let \(D\) be a minimum secure dominating set of \(G\). If \(V-D\) contains a secure total dominating set \(D'\) of \(G\) then \(D'\) is called an inverse secure dominating set with respect to \(D\). The smallest cardinality of inverse secure dominating set of \(G\) is the secure domination number \(\gamma_s^{-1}(G)\)
openaire +2 more sources
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source

