نتایج جستجو برای: strong arc
تعداد نتایج: 407686 فیلتر نتایج به سال:
The Arc/Arg3.1 gene product is rapidly upregulated by strong synaptic activity and critically contributes to weakening synapses by promoting AMPA-R endocytosis. However, how activity-induced Arc is redistributed and determines the synapses to be weakened remains unclear. Here, we show targeting of Arc to inactive synapses via a high-affinity interaction with CaMKIIβ that is not bound to calmodu...
Using a high-throughput cell-based assay, we identified a nucleoside analogue 4-amino-6-hydrazino-7-beta-D-ribofuranosyl-7H-pyrrolo(2,3-d)-pyrimidine-5-carboxamide (ARC), which has the properties of a general transcriptional inhibitor. Specifically, ARC inhibits the phosphorylation of RNA polymerase II by positive transcription elongation factor-b, leading to a block in transcriptional elongati...
Thomassen (J. Combin. Theory Ser. B 28, 1980, 142–163) proved that every strong tournament contains a vertex x such that each arc going out from x is contained in a Hamiltonian cycle. In this paper, we extend the result of Thomassen and prove that a strong tournament contains a vertex x such that every arc going out from x is pancyclic, and our proof yields a polynomial algorithm to nd such a v...
Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...
An arc in a tournament T with n ≥ 3 vertices is called k-pancyclic, if it belongs to a cycle of length l for all k ≤ l ≤ n. In this paper, the result that each s-strong (s ≥ 3) tournament T contains at least s + 2 out-arc 5-pancyclic vertices is obtained. Furthermore, our proof yields a polynomial algorithm to find s + 2 out-arc 5-pancyclic vertices of T .
für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید