Results 1 to 10 of about 4,433 (166)
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
Septyanto Fendy, Sugeng Kiki A.
doaj +3 more sources
Proper Rainbow Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Doan Trung Duy, Schiermeyer Ingo
doaj +4 more sources
Rainbow connection number of generalized composition [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a connected graph with . The rainbow connection number is the smallest for which there is a map such that any two vertices can be connected by a path whose edge colors are all distinct.
Fendy Septyanto, Kiki Ariyanti Sugeng
doaj +2 more sources
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +3 more sources
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 ...
Afifah Farhanah Akadji +3 more
doaj +2 more sources
Rainbow connection number of comb product of graphs
Electronic Journal of Graph Theory and Applications, 2022 An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path.
Dinny Fitriani +2 more
doaj +3 more sources
Rainbow connections of bioriented graphs [PDF]
HeliyonFor a directed graph D, it's deemed rainbow connected if each arc is assigned a different color, so that all paths from the vertex u to the vertex v are rainbow connected.
Linlin Wang, Sujuan Liu, Han Jiang
doaj +2 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 ...
Přemysl Holub +2 more
exaly +3 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.
Li Hengzhe, Ma Yingbin, Li Xueliang
doaj +2 more sources
The Rainbow Connection Number of the Power Graph of a Finite Group [PDF]
Graphs and Combinatorics, 2015 10 pages, 5 figures, accepted by Graphs and Combinatorics on July ...
Min Feng, Xuanlong Ma, Wang Kaishun
exaly +3 more sources