Results 41 to 50 of about 313,328 (262)
Sažetak abstracta: The necessary and sufficient conditions on the existence of the trees with prescribed edge degrees are given.
openaire +3 more sources
Edge-decompositions of graphs with high minimum degree [PDF]
41 pages.
Barber, Ben +3 more
openaire +7 more sources
Representations of Edge Intersection Graphs of Paths in a Tree [PDF]
Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic +2 more
doaj +1 more source
Bridge-edge Identification Method of Command and Control Network Based on Bridging Coefficient [PDF]
The bridge-edge is the pivot of network structure connection and plays a crucial role in the flow of command and control network information.Accurately identifying and protecting the bridge edge can greatly improve the destruction resistance of the ...
GAO Xiue, CHEN Xiaoshuang, WANG Yunming, CHEN Bo
doaj +1 more source
Mapping the evolution of mitochondrial complex I through structural variation
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Molecular bases of circadian magnesium rhythms across eukaryotes
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 Parsimonious Edge-Colouring of Graphs with Maximum Degree Three [PDF]
In a graph $G$ of maximum degree $ $ let $ $ denote the largest fraction of edges that can be $ $ edge-coloured. Albertson and Haas showed that $ \geq 13/15$ when $G$ is cubic . We show here that this result can be extended to graphs with maximum degree 3 with the exception of a graph on 5 vertices.
Fouquet, J.-L., Vanherpe, J.-M.
openaire +3 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
Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj +1 more source

