Results 11 to 20 of about 282,874 (123)
Graphs with 3-Rainbow Index n − 1 and n − 2
Discussiones Mathematicae Graph Theory, 2015 Let G = (V (G),E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Li Xueliang +3 more
doaj +1 more source
Genetics of Growth Reaction Norms in Farmed Rainbow Trout
PLoS ONE, 2015 Rainbow trout is farmed globally under diverse uncontrollable environments. Fish with low macroenvironmental sensitivity (ES) of growth is important to thrive and grow under these uncontrollable environments. The ES may evolve as a correlated response to
P. Sae-Lim +5 more
semanticscholar +1 more source
Graphs with 4-Rainbow Index 3 and n − 1
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G),
Li Xueliang +3 more
doaj +1 more source
An updated survey on rainbow connections of graphs - a dynamic survey
Theory and Applications of Graphs, 2017 The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Xueliang Li, Yuefang Sun
doaj +1 more source
The Vertex-Rainbow Index of A Graph
Discussiones Mathematicae Graph Theory, 2016 The k-rainbow index rxk(G) of a connected graph G was introduced by Chartrand, Okamoto and Zhang in 2010. As a natural counterpart of the k-rainbow index, we introduce the concept of k-vertex-rainbow index rvxk(G) in this paper.
Mao Yaping
doaj +1 more source
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
Notulae Botanicae Horti Agrobotanici Cluj-Napoca, 2016 Canola (Brassica napus L.) crop ranks third after soybean and palm among oilseed crops for production of vegetable oil and meal for human and livestock, respectively around the globe.
Sibgha NOREEN +4 more
doaj +1 more source
Frontiers in Marine Science, 2015 Data about the toxicological effects of cerium dioxide nanoparticles (CeO2 NP) in fish are scarce. This work aimed to assess the CeO2 NP possible deleterious effects on the gills of Oncorhynchus mykiss.
Alberto Teodorico Correia +1 more
doaj +1 more source
Scientific Papers Animal Science and Biotechnologies, 2023 Experiments were conducted throughout 2009 and 2010. At the beginning of experiments, both in 2009 and in 2010, were formed two groups (M-control group; E-experimental group), each group far 600 rainbow trout (Oncorhynchus mykiss).
Vioara Mireşan +7 more
doaj
BMC Genetics, 2011 BackgroundThere is increasing evidence that the ability to adapt to seawater in teleost fish is modulated by genetic factors. Most studies have involved the comparison of species or strains and little is known about the genetic architecture of the trait.
Yvan Le Bras +10 more
semanticscholar +1 more source