Results 1 to 10 of about 6,399 (84)
Aquaculture Reports, 2023 Rainbow trout (Oncorhynchus mykiss) are native to the Pacific Ocean coast of North America and the Kamchatka Peninsula of Russia. Brazilian populations of rainbow trout derive from various imports from European countries, the United States of America (U ...
Noeliton Teixeira de Araújo Júnior +4 more
doaj +1 more source
The strong 3-rainbow index of edge-comb product of a path and a connected graph
Electronic Journal of Graph Theory and Applications, 2022 Let G be a connected and edge-colored graph of order n, where adjacent edges may be colored the same. A tree in G is a rainbow tree if all of its edges have distinct colors. Let k be an integer with 2 ≤ k ≤ n.
Zata Yumni Awanis +2 more
doaj +1 more source
The two-loop contributions to muon MDM in $$U(1)_X$$ U ( 1 ) X SSM
European Physical Journal C: Particles and Fields, 2021 The MSSM is extended to the $$U(1)_X$$ U ( 1 ) X SSM, whose local gauge group is $$SU(3)_C \times SU(2)_L \times U(1)_Y \times U(1)_X$$ S U ( 3 ) C × S U ( 2 ) L × U ( 1 ) Y × U ( 1 ) X . To obtain the $$U(1)_X$$ U ( 1 ) X SSM, we add the new superfields
Lu-Hao Su +5 more
doaj +1 more source
More on the Minimum Size of Graphs with Given Rainbow Index
Discussiones Mathematicae Graph Theory, 2020 The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj +1 more source
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
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
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
The Scientific World Journal, 2012 Genetic characterization of strains of Streptococcus iniae recovered from morbidity and mortality of farmed rainbow trout in different provinces of Iran were studied.
A. Erfanmanesh +4 more
doaj +1 more source
Frontiers in Immunology, 2019 In systemic lupus erythematosus (SLE), perturbed immunoregulation underpins a pathogenic imbalance between regulatory and effector CD4+ T-cell activity.
Ricardo C. Ferreira +18 more
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