Results 1 to 10 of about 5,179 (208)
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
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
Desimal, 2021 A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Afifah Farhanah Akadji +3 more
doaj +1 more source
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 +1 more source
On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2021 All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of ...
Marsidi Marsidi +3 more
doaj +1 more source
Barekeng, 2023 Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by .
Nisky Imansyah Yahya +3 more
doaj +1 more source
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 +1 more source
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 +1 more source
(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 +1 more source
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 +1 more source