Results 21 to 30 of about 289,295 (264)
(1, 2)-rainbow connection number at most 3 in connected dense graphs
Electronic Journal of Graph Theory and Applications, 2023 Let G be an edge-coloured connected graph G. A path P in the graph G is called l-rainbow path if each subpath of length at most l + 1 is rainbow. The graph G is called (k, l)-rainbow connected if any two vertices in G are connected by at least k pairwise
Trung Duy Doan, Le Thi Duyen
doaj +2 more sources
Upper bounding rainbow connection number by forest number [PDF]
Discrete Mathematics, 2020 A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertices.
L. Chandran +3 more
semanticscholar +6 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
Color code techniques in rainbow connection [PDF]
Electronic Journal of Graph Theory and Applications, 2018 Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj +2 more sources
Rainbow connection number of Cm o Pn and Cm o Cn
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a nontrivial connected graph. A rainbow path is a path which is each edge colored with different color. A rainbow coloring is a coloring which any two vertices should be joined by at least one rainbow path.
Alfi Maulani +3 more
doaj +2 more sources
On strong rainbow connection number [PDF]
, 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. For any two vertices $u$ and $v$ of $G$, a rainbow $u-v$ geodesic in $G$ is a rainbow $u-v$ path of length $d(u,v)
Li, Xueliang, Sun, Yuefang
core +2 more sources
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +2 more sources
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +3 more sources
Rainbow connection number of amalgamation of some graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +2 more sources
Oriented diameter and rainbow connection number of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xiaolong Huang +3 more
doaj +4 more sources