Results 101 to 110 of about 10,021,129 (363)
Perfect secure domination in graphs [PDF]
Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi +3 more
doaj
Graphs With Large Semipaired Domination Number
Let G be a graph with vertex set V and no isolated vertices. A sub-set S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset
T. Haynes, Michael A. Henning
semanticscholar +1 more source
Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]
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
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 2-domination number of cylindrical graphs [PDF]
José A. Martínez +2 more
openalex +1 more source
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 and Double Total Domination Number on Hexagonal Grid
In this paper, we determine the upper and lower bound for the total domination number and exact values and the upper bound for the double-total domination number on hexagonal grid H m , n with m hexagons in a row and n hexagons in a column.
A. Klobucar, A. Klobučar
semanticscholar +1 more source
The role of histone modifications in transcription regulation upon DNA damage
This review discusses the critical role of histone modifications in regulating gene expression during the DNA damage response (DDR). By modulating chromatin structure and recruiting repair factors, these post‐translational modifications fine‐tune transcriptional programmes to maintain genomic stability.
Angelina Job Kolady, Siyao Wang
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
Domination number in the annihilating-submodule graph of modules over\n commutative rings [PDF]
H. Ansari-Toroghy, Shokoufeh Habibi
openalex +1 more source

