Results 81 to 90 of about 445,292 (276)
On the distinguishing chromatic number of the Kronecker products of graphs
AKCE International Journal of Graphs and CombinatoricsIn 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Sickle cell disease (SCD) has undergone major changes in the last decades. Its prevalence has been steadily increasing and numerous advances have been made in the management of the disease. However, the effect in real‐life setting of these major changes is unknown, particularly in a Canadian environment. Procedure We aimed to assess
Maude Cigna +16 more
wiley +1 more source
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Impossibility of Distinguishing Two Preparations for a Pure State from No-signaling
Quanta, 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
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS 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
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS [PDF]
Bulletin of the Korean Mathematical Society, 2015 In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and of the Johnson graphs.
Kim, Dongseok +2 more
openaire +2 more sources
The number of different distinguishing colorings of a graph [PDF]
, 2019 A vertex coloring of a graph $G$ is called distinguishing if no non-identity automorphism of $G$ preserves it. The distinguishing number of $G$, denoted by $D(G)$, is the smallest number of colors required for such a coloring.
Shekarriz, Mohammad Hadi
core
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Characterization of graphs with distinguishing number equal list distinguishing number
, 2017 The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. A list assignment to $G$ is an assignment $L = \{L(v)\}_{v\in V (G)}$ of lists of labels to the vertices of $G$. A distinguishing $L$-labeling of $G$ is a distinguishing labeling
Alikhani, Saeid, Soltani, Samaneh
openaire +2 more sources