Results 11 to 20 of about 9,765,356 (168)
Rainbow Vertex-Connection and Forbidden Subgraphs [PDF]
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +3 more sources
The Rainbow Vertex Connection Number of Some Amalgamation of Two Cycles
Tensor: Pure and Applied Mathematics JournalThis paper focuses on rainbow vertex coloring in a graph G, in which, for every two vertices in G, there exists a rainbow vertex path where all internal vertices have distinct colors.
Pranaya D. M. Taihuttu +3 more
semanticscholar +2 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 +2 more sources
(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 +2 more sources
On the Rainbow Vertex-Connection [PDF]
Discussiones Mathematicae Graph Theory, 2013 A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that ...
Li Xueliang, Shi Yongtang
doaj +2 more sources
A Study on Strong Rainbow Vertex-Connection in Some Classes of Generalized Petersen Graphs
Procedia Computer Science, 2020 In a vertex colored graph G, a rainbow path is defined as a path in which all the internal vertices get different colors. The graph G is called a strongly rainbow vertex-connected graph, if at least one shortest rainbow path exists between every pair of ...
M HeldaMercy, I. Arputhamary
exaly +2 more sources
Rainbow connection number of amalgamation of some graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +2 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.
A. W. Bustan +3 more
semanticscholar +2 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 +2 more sources
Rainbow Connection Number of Octopus Iteration Graphs
InPrimeThe rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al.
Desi Rahmadani +4 more
doaj +2 more sources