Results 1 to 10 of about 101,543 (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
Rainbow Connection Number and Radius [PDF]
Graphs and Combinatorics, 2012 The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges are coloured the same.
Basavaraju, Manu +3 more
core +3 more sources
Rainbow Connection Number and Connected Dominating Sets [PDF]
Electronic Notes in Discrete Mathematics, 2010 Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same.
Caro +8 more
core +4 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
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +6 more sources
On Rainbow Connection Number and Connectivity [PDF]
The Electronic Journal of Combinatorics, 2011 Rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same.
Deepak Rajendraprasad +4 more
core +5 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
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 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
Rainbow connection number, bridges and radius [PDF]
Graphs and Combinatorics, 2011 Let $G$ be a connected graph. The notion \emph{the rainbow connection number $rc(G)$} of a graph $G$ was introduced recently by Chartrand et al. Basavaraju et al.
Dong, Jiuying, Li, Xueliang
core +2 more sources