Results 31 to 40 of about 9,765,356 (168)
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
The rainbow connection problem: Mathematical formulations
, 2016 The concept of rainbow connection was introduced by Chartrand et al. in 2008. The rainbow connection number, rc(G), of a connected graph G = (V, E) is the minimum number of colors needed to color the edges of E, so that each pair of the vertices in V is ...
Ugurlu, O., Kutucu, H., Nuriyeva, F.
core +7 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 +1 more source
Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs
Ars Comb., 2023 A vertex-colouring of a graph Γ is rainbow vertex connected if every pair of vertices ( u , v ) in Γ there is a u − v path whose internal vertices have different colours.
Yingbin Ma, Kairui Nie
semanticscholar +1 more source
On the inverse graph of a finite group and its rainbow connection number
Electronic Journal of Graph Theory and Applications, 2023 A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow ...
Rian Febrian Umbara +2 more
doaj +1 more source
The rainbow connection number of the enhanced power graph of a finite group
Electronic Journal of Graph Theory and Applications, 2023 Let G be a finite group. The enhanced power graph ΓGe of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow connection number of ΓGe.
Luis A. Dupont +2 more
doaj +1 more source
Distance-Local Rainbow Connection Number [PDF]
, 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
Sugeng, Kiki A., Septyanto, Fendy
core +1 more source
Further hardness results on the rainbow vertex-connection number of graphs [PDF]
Theoretical Computer Science, 2011 A vertex-colored graph $G$ is {\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster.
Lily Chen, Xueliang Li, Huishu Lian
semanticscholar +1 more source
On the locating rainbow connection number of amalgamation of complete graphs
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.
A. W. Bustan, A. Salman, P. E. Putri
semanticscholar +1 more source
On the study of Rainbow Antimagic Connection Number of Corona Product of Graphs
European Journal of Pure and Applied Mathematics, 2023 Given that a graph G = (V, E). By an edge-antimagic vertex labeling of graph, we mean assigning labels on each vertex under the label function f : V → {1, 2, . . . , |V (G)|} such that the associated weight of an edge uv ∈ E(G), namely w(xy) = f(x) + f(y)
B. J. Septory +4 more
semanticscholar +1 more source