Results 11 to 20 of about 5,748 (282)
Desimal, 2021 A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Akadji, Afifah Farhanah +3 more
core +2 more sources
Distance-Local Rainbow Connection Number
Discussiones Mathematicae Graph Theory, 2022 Under an edge coloring (not necessarily proper), a rainbow path is a path whose edge colors are all distinct. The d-local rainbow connection number lrcd(G) (respectively, d-local strong rainbow connection number lsrcd(G)) is the smallest number of colors
Sugeng, Kiki A., Septyanto, Fendy
core +2 more sources
Barekeng, 2022 If be a graph and edge coloring of G is a function , rainbow connection number is the minimum-k coloration of the rainbow on the edge of graph G and denoted by rc(G). Rainbow connection numbers can be applied to the result of operations on some special
Ismail, Sumarno +7 more
core +3 more sources
On the rainbow vertex-connection
Discussiones Mathematicae Graph Theory, 2013 A vertex-colored graph is {\it rainbow vertex-connected} if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\it 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 ...
Xueliang Li 0001, Yongtang Shi
openaire +3 more sources
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
core +3 more sources
Generalized rainbow connection of graphs and their complements
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li Xueliang +3 more
openaire +2 more sources
The Vertex-Rainbow Connection Number of Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same.
Ma Yingbin +5 more
core +2 more sources
The rainbow connection problem: Mathematical formulations
Ars Comb., 2016 The concept of rainbow connection was introduced by Chartrand et al. in 2008. The rainbow connection number, rc(G), of a connected graph G = (V, E) is the minimum number of colors needed to color the edges of E, so that each pair of the vertices in V is ...
Ugurlu, O., Kutucu, H., Nuriyeva, F.
core +10 more sources
The rainbow connection number of 2-connected graphs
Discrete Mathematics, 2013 The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. Improving a result of Caro et al., we prove that the rainbow connection number of every 2-connected graph with n vertices is at most the ceiling of ...
Jan Ekstein +2 more
exaly +3 more sources
Rainbow connection and forbidden subgraphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Přemysl Holub +2 more
exaly +2 more sources