Results 1 to 10 of about 289,295 (264)
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 +4 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
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 +3 more sources
The Vertex-Rainbow Connection Number of Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same.
Li Hengzhe, Ma Yingbin, Li Xueliang
doaj +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
Barekeng, 2022 If be a graph and edge coloring of G is a function , rainbow connection number is the minimum-k coloration of the rainbow on the edge of graph G and denoted by rc(G). Rainbow connection numbers can be applied to the result of operations on some special
Sumarno Ismail +3 more
doaj +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
BATAS ATAS RAINBOW CONNECTION NUMBER PADA GRAF BUCKMINSTERFULLERENE
Jurnal Matematika UNAND, 2022 Misalkan G adalah suatu graf terhubung tak trivial. 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.
Fitri - Anggalia +2 more
doaj +2 more sources
Rainbow connections of bioriented graphs [PDF]
HeliyonFor a directed graph D, it's deemed rainbow connected if each arc is assigned a different color, so that all paths from the vertex u to the vertex v are rainbow connected.
Linlin Wang, Sujuan Liu, Han Jiang
doaj +2 more sources
Total Rainbow Connection Number of Some Graph Operations
Axioms, 2022 In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The total coloring of a graph H is a total rainbow connected coloring if, for any x,y∈V(H), there is
Hengzhe Li, Yingbin Ma, Yan Zhao
doaj +2 more sources