Results 61 to 70 of about 402,994 (257)

Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing

open access: yesFEBS Letters, EarlyView.
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

All Graphs of Order n with Distinguishing Number n−1 or n − 2

open access: yesTheory and Applications of Graphs
Let G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism.
Andi Pujo Rahadi   +2 more
doaj   +1 more source

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)

open access: yesDiscussiones Mathematicae Graph Theory, 2013
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj   +1 more source

Well‐quasi‐ordering and finite distinguishing number [PDF]

open access: yesJournal of Graph Theory, 2019
AbstractBalogh, Bollobás and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary classes of graphs at the sequence of Bell numbers. We prove that every hereditary class that lies above the Bell numbers and has finite distinguishing number contains a ...
Aistis Atminas, Robert Brignall
openaire   +3 more sources

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS Letters, EarlyView.
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

Time after time – circadian clocks through the lens of oscillator theory

open access: yesFEBS Letters, EarlyView.
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

On the distinguishing chromatic number of the Kronecker products of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
In this paper, we investigate the distinguishing chromatic number of Kronecker product of paths, cycles, star graphs, symmetric trees, almost symmetric trees, and bisymmetric trees.
Zinat Rastgar   +2 more
doaj   +1 more source

Impossibility of Distinguishing Two Preparations for a Pure State from No-signaling

open access: yesQuanta, 2020
A pure state of a physical system can be prepared in an infinite number of ways. Quantum theory dictates that given a pure state of a physical system it is impossible to distinguish two preparation procedures.
Arun Kumar Pati
doaj   +1 more source

Distinguishing number and distinguishing index of some operations on graphs

open access: yesJournal of Information and Optimization Sciences, 2018
11 pages, 4 ...
Alikhani, Saeid, Soltani, Samaneh
openaire   +2 more sources

The Distinguishing Chromatic Number of Kneser Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2013
A labeling $f: V(G) \rightarrow \{1, 2, \ldots, d\}$ of the vertex set of a graph $G$ is said to be proper $d$-distinguishing if it is a proper coloring of $G$ and any nontrivial automorphism of $G$ maps at least one vertex to a vertex with a different label.
Che, Zhongyuan, Collins, Karen L.
openaire   +2 more sources

Home - About - Disclaimer - Privacy