Results 51 to 60 of about 422,220 (274)

Split Legendary Domination in graphs

open access: yesRatio Mathematica
Harary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj   +1 more source

Domination Cover Pebbling: Structural Results [PDF]

open access: yes, 2005
This paper continues the results of "Domination Cover Pebbling: Graph Families." An almost sharp bound for the domination cover pebbling (DCP) number for graphs G with specified diameter has been computed.
Watson, Nathaniel G., Yerger, Carl R.
core  

Molecular bases of circadian magnesium rhythms across eukaryotes

open access: yesFEBS Letters, EarlyView.
Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley   +1 more source

On Domination Number and Distance in Graphs [PDF]

open access: yes, 2014
A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating ...
Kang, Cong X.
core  

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

open access: yesFEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang   +8 more
wiley   +1 more source

Block Graphs with Large Paired Domination Multisubdivision Number

open access: yesDiscussiones Mathematicae Graph Theory, 2021
The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G.
Mynhardt Christina M., Raczek Joanna
doaj   +1 more source

Graphs with Constant Sum of Domination and Inverse Domination Numbers [PDF]

open access: yesInternational Journal of Combinatorics, 2012
A subset D of the vertex set of a graph G, is a dominating set if every vertex in V−D is adjacent to at least one vertex in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. A subset of V−D, which is also a dominating set of G is called an inverse dominating set of G with respect to D. The inverse domination number γ′(G)
Chelvam, T. Tamizh, Asir, T.
openaire   +1 more source

$ k $-domination and total $ k $-domination numbers in catacondensed hexagonal systems

open access: yesMathematical Biosciences and Engineering, 2022
<abstract><p>In this paper we study the $ k $-domination and total $ k $-domination numbers of catacondensed hexagonal systems. More precisely, we give the value of the total domination number, we find upper and lower bounds for the $ 2 $-domination number and the total $ 2 $-domination number, characterizing the catacondensed hexagonal ...
Sergio Bermudo   +2 more
openaire   +4 more sources

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

open access: yesFEBS 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

On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree

open access: yesMathematics, 2020
A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S .
Zehui Shao   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy