نتایج جستجو برای: strong arc
تعداد نتایج: 407686 فیلتر نتایج به سال:
A k?coloring of an oriented graph G = (V; A) is an assignment c of one of the colors 1; 2; : : :; k to each vertex of the graph such that, for every arc (x; y) of G, c(x) 6 = c(y). The k?coloring is good if for every arc (x; y) of G there is no arc (z; t) 2 A such that c(x) = c(t) and c(y) = c(z). A k?coloring is said to be semi?strong if for every vertex x of G, c(z) 6 = c(t) for any pair fz; ...
A glowing ribbon of purple light running east-west in the night sky has recently been observed by citizen scientists. This narrow, subauroral, visible structure, distinct from the traditional auroral oval, was largely undocumented in the scientific literature and little was known about its formation. Amateur photo sequences showed colors distinctly different from common types of aurora and occa...
Arc/Arg3.1 is an immediate-early gene whose expression levels are increased by strong synaptic activation, including synapse-strengthening activity patterns. Arc/Arg3.1 mRNA is transported to activated dendritic regions, conferring the distribution of Arc/Arg3.1 protein both temporal correlation with the inducing stimulus and spatial specificity. Here, we investigate the effect of increased Arc...
In this survey we overview known results on the strong subgraph [Formula: see text]-connectivity and text]-arc-connectivity of digraphs. After an introductory section, paper is divided into four sections: basic results, algorithms complexity, sharp bounds for text]-(arc-)connectivity, minimally text]-(arc-) connected This contains several conjectures open problems further study.
In this paper we study the network design arc set with variable upper bounds. This set appears as a common substructure of many network design problems and is a relaxation of several fundamental mixed-integer sets studied earlier independently. In particular, the splittable flow arc set, the unsplittable flow arc set, the single node fixed-charge flow set, and the binary knapsack set are facial...
An in-tournament is an oriented graph such that the in-neighborhood of every vertex induces a tournament. Recently, we have shown that every arc of a strongly connected tournament of order n is contained in a directed path of order r(n + 3)/21. This is no longer valid for strongly connected in-tournaments, because there exist examples containing an arc with the property that the longest directe...
If D is a strongly connected digraph, then an arc set S of D is called a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. Recently, Volkmann [12] defined the restricted arc-connectivity λ(D) as the minimum cardinality over all restricted arc-cuts S. A strongly connected digraph D is called λconnected when λ(D) exists. Let k ≥ 2 be an i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید