Results 1 to 10 of about 260,846 (163)
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 +2 more sources
The 3-Rainbow Index of a Graph [PDF]
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 +2 more sources
Graphs with 3-Rainbow Index n − 1 and n − 2 [PDF]
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 +2 more sources
Graphs with 4-Rainbow Index 3 and n − 1 [PDF]
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 +2 more sources
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 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
The Rainbow Prim Algorithm for Selecting Putative Orthologous Protein Sequences [PDF]
, 2008 We present a selection method designed for eliminating species redundancy in clusters of putative orthologous sequences, to be applied as a post-processing procedure to pre-clustered data obtained from other methods. The algorithm can always zero-out the
Aloisio, G. +4 more
core +1 more source
On the threshold for rainbow connection number r in random graphs [PDF]
, 2013 We call an edge colouring of a graph G a rainbow colouring if every pair of vertices is joined by a rainbow path, i.e., a path where no two edges have the same colour.
Heckel, Annika, Riordan, Oliver
core +1 more source
Guided by the light: Roost choice and behaviour of urban Rainbow Lorikeets (Trichoglossus haematodus) [PDF]
, 2016 1. The formation of large communal roosts is a conspicuous phenomenon associated with a wide range of bird species successfully exploiting urban environments.
Daoud-Opit, Savannah, Jones, Darryl N.
core +2 more sources