نتایج جستجو برای: 1 gravitys rainbow 2 paranoia 3 anti
تعداد نتایج: 4739061 فیلتر نتایج به سال:
An r-edge coloring of a graph G is a mapping h : E(G) → [r], where h(e) is the color assigned to edge e ∈ E(G). An exact r-edge coloring is an r-edge coloring h such that there exists an e ∈ E(G) with h(e) = i for all i ∈ [r]. Let h be an edge coloring of G. We say G is rainbow if no two edges in G are assigned the same color by h. The anti-Ramsey number, AR(G,n), is the smallest integer r such...
A tree T , in an edge-colored graph G, is called a rainbow tree if no two edges of T are assigned the same color. A k-rainbow coloring of G is an edge coloring of G having the property that for every set S of k vertices of G, there exists a rainbow tree T in G such that S ⊆ V (T ). The minimum number of colors needed in a k-rainbow coloring of G is the k-rainbow index of G, denoted by rxk(G). G...
Paranoia is common and distressing in the general population and can impact on health, emotional well-being and social functioning, such that effective interventions are needed. Brief online mindfulness-based interventions (MBIs) have been shown to reduce symptoms of anxiety and depression in non-clinical samples; however, at present, there is no research investigating whether they can reduce p...
this study was conducted to evaluate the effect of prebiotic short saccharomyces cerevisiae yeast cell wall (ycw) on growth , nutrition and survival rates , blood indices of rainbow trout (oncorhynchus mykiss) were studied . 600 pieces of salmon with an average weight of (1 ± 20) g 4 treatments and 3 replications (each replication 50 pieces of fish) groups. treatments 1, 2, 3 and 4, respectivel...
A k-rainbow dominating function of a graph G is a map f from V (G) to the set of all subsets of {1, 2, . . . , k} such that {1, . . . , k} = ⋃ u∈N(v) f(u) whenever v is a vertex with f(v) = ∅. The k-rainbow domination number of G is the invariant γrk(G), which is the minimum sum (over all the vertices of G) of the cardinalities of the subsets assigned by a k-rainbow dominating function. We focu...
In this paper, we mainly investigate graphs with a small (strong) proper connection number and large clique number. First, discuss the of graph G order n ω(G)=n−i for 1⩽i⩽3. Next, rainbow n, diam(G)≥3 2⩽i⩽3.
background: vitamin c is one of the important nutrients in fish culture and as a potent anti-oxidant, is of great importance in preserving cells against oxidation and boosting resistance in stress conditions and against pathogens. objectives: the purpose of the present study is to add high level of vitamin c supplementation to rainbow trout (oncorhynchus mykiss) diet reared at high density and ...
BACKGROUND Sleep difficulties might be a contributory causal factor in the occurrence of mental health problems. If this is true, improving sleep should benefit psychological health. We aimed to determine whether treating insomnia leads to a reduction in paranoia and hallucinations. METHODS We did this single-blind, randomised controlled trial (OASIS) at 26 UK universities. University student...
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconnected. It was proved that ifG is a graph of order n with minimum degree δ, then rvc(G) < 11n/δ. I...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we investigate the relationship of rainbow connection number with vertex and edge connectivity. It is already known that for a connected graph with minimum...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید