Results 31 to 40 of about 274,074 (298)
The hitting time of rainbow connection number two [PDF]
The Electronic Journal of Combinatorics, 2012 In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so that every pair of vertices is joined by at least one rainbow path is ...
Heckel, Annika, Riordan, Oliver
core +4 more sources
On The Locating Rainbow Connection Number of A Graph [PDF]
, 2021 Let k be a positive integer and G = (V(G), E(G)) be a finite and connected graph. A rainbow vertex k-coloring of G is a function c: V(G) → {1,2,…, k} such that for every two vertices u and v in V(G) there exists a u-v path whose internal vertices have ...
Ariestha Widyastuty Bustan +2 more
openalex +2 more sources
Local Strong Rainbow Connection Number of Corona Product Between Cycle Graphs
Indonesian Journal of Combinatorics, 2023 A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah +1 more
openalex +3 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 and independence number of a graph [PDF]
Graphs and Combinatorics, 2012 14 ...
Jiu-Ying Dong, Xueliang Li
openalex +5 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
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
The rainbow connection number of 2-connected graphs [PDF]
Discrete Mathematics, 2011 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 +6 more
openalex +3 more sources
The rainbow connection number of a watermill graph
Journal of Physics: Conference Series, 2019 Let G be a simple, finite and undirected connected graph. An edge-colored graph G is called rainbow connected, if any two vertices in the graph are connected by a path which the edges have distinct colors. Such a path is called rainbow path.
Nurul Maulida Surbakti +1 more
openalex +2 more sources
On the rainbow connection number of triangle-net graph
, 2021 Let G be an arbitrary non-trivial connected graph. For every two vertices u and v in G, a (u,v)-path in G is called a rainbow (u,v)-path if all edges are colored differently.
Lyra Yulianti +3 more
openalex +2 more sources