Results 11 to 20 of about 274,074 (298)
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
On the locating rainbow connection number of amalgamation of complete graphs [PDF]
Journal of Physics: Conference Series, 2023 Locating rainbow connection number determines the minimum number of colors connecting any two vertices of a graph with a rainbow vertex path and also verifies that the given colors produce a different rainbow code for each vertex.
Ariestha Widyastuty Bustan +2 more
openalex +2 more sources
On the threshold for rainbow connection number r in random graphs [PDF]
, 2013 We call an edge colouring of a graph G a rainbow colouring if every pair of vertices is joined by a rainbow path, i.e., a path where no two edges have the same colour.
Heckel, Annika, Riordan, Oliver
core +3 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
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
PENENTUAN RAINBOW CONNECTION NUMBER DAN STRONG RAINBOW CONNECTION NUMBER PADA GRAF BERLIAN [PDF]
Jurnal Matematika UNAND, 2017 Misalkan G = (V, E) adalah suatu graf. Suatu pewarnaan c : E(G) → {1, 2, · · · , k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama. Misalkan u, v ∈ V (G) dan P adalah suatu lintasan dari u ke v. Suatu intasan P dikatakan rainbow path jika tidak terdapat dua sisi di P berwarna
SUCI RIEZSA DESSYLUVIANI
+5 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
On the Locating Rainbow Connection Number of Trees and Regular Bipartite Graphs [PDF]
Emerging Science Journal, 2023 Locating the rainbow connection number of graphs is a new mathematical concept that combines the concepts of the rainbow vertex coloring and the partition dimension.
Ariestha Widyastuty Bustan +3 more
openalex +2 more sources
The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path.
Dinda Kartika +2 more
doaj +2 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