Results 21 to 30 of about 9,657,260 (124)
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
core +6 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 +4 more sources
Bounds for the rainbow connection number of graphs [PDF]
Discussiones Mathematicae Graph Theory, 2011 An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edges have distinct colours. The rain-bow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order ...
Ingo Schiermeyer, Schiermeyer, Ingo
openaire +3 more sources
Rainbow Connection Number and Connected Dominating Sets [PDF]
Electronic Notes in Discrete Mathematics, 2011 AbstractThe rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree δ, the rainbow connection number ...
L. Sunil Chandran +3 more
openaire +7 more sources
The Rainbow (Vertex) Connection Number of Pencil Graphs [PDF]
Procedia Computer Science, 2015 AbstractAn edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in order to make G rainbow connected. The vertex-colored graph G is said rainbow vertex-connected,
Dian N. S. Simamora, A. N. M. Salman
openaire +2 more sources
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 called the rainbow connection number $\mathrm{rc}(G)$ of the graph $G$.
Heckel, A, Riordan, O
core +7 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 corona product of graphs
Electronic Journal of Graph Theory and ApplicationsIn an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj +3 more sources
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
MathematicsAn edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses a distinct color.
Fu-Hsing Wang, Cheng-Ju Hsu
doaj +3 more sources
A mathematical model for finding the rainbow connection number
2013 7th International Conference on Application of Information and Communication Technologies, 2013 The rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.
Nuriyeva, Fidan +2 more
openaire +4 more sources