Results 61 to 70 of about 101,543 (166)
Rainbow connection numbers of complementary graphs
, 2010 A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if there is a rainbow path connecting any two vertices, and the rainbow connection number of $G$, denoted by $rc(G)$, is the minimum number of colors that are ...
Li, Xueliang, Sun, Yuefang
openaire +2 more sources
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
Rainbow and strong rainbow connection number for some families of graphs
Proyecciones (Antofagasta), 2020 Let G be a nontrivial connected graph. Then G is called a rainbow connected graph if there exists a coloring c : E(G) → {1, 2, ..., k}, k ∈ N, of the edges of G, such that there is a u − v rainbow path between every two vertices of G, where a path P in G is a rainbow path if no two edges of P are colored the same.
Yaqoub Ahmed Khan +3 more
openaire +2 more sources
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
Creation of fish databases for electronic interactive map: tables and keys
Ribogospodarsʹka Nauka Ukraïni, 2019 Purpose. Purpose of the work is to create fish databases using rainbow trout data and basing on new methods of theoretical analysis of fish data and their ordering in hierarchical structures with elements represented as relation tables linked through a ...
O. Klyuchko +3 more
doaj +1 more source
Dawn to Dusk: Diurnal Rhythm of the Immune Response in Rainbow Trout (Oncorhynchus Mykiss)
Biology, 2019 The daily change of light and dark periods influences different physiological processes including feeding, resting and locomotor activity. Previously, several studies on mammalian models revealed a strong link between day-night rhythms and key ...
Ruth Montero +7 more
doaj +1 more source
On Rainbow Connection Number of Some Graphs
International Journal of Engineering and Advanced Technology, 2019 The Rainbow connection number for the following graphs, two copies of Fan graph by a path , Arrow graph and Θ , Jellyfish graph and Cycle Cactus graph have been described in this ...
Shalini Rajendra Babu, N. Ramya
openaire +1 more source
On the Rainbow Vertex-Connection
Discussiones Mathematicae Graph Theory, 2013 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 ...
Li Xueliang, Shi Yongtang
doaj +1 more source