Results 21 to 30 of about 650 (167)
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
The rainbow vertex connection number of star wheel graphs [PDF]
AIP Conference Proceedings, 2019 A vertex-colored graph G = (V(G), E(G)) is said to be rainbow vertex-connected, if for every two vertices u and v in V(G), there exists a u – v path with all internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors needed to make G rainbow vertex connected.
Ariestha Widyastuty Bustan +1 more
openaire +1 more source
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-Vertex Connection Number [RVCN] of Subdivision of Certain Graphs
International Journal of Scientific Research in Science, Engineering and Technology, 2022 Rainbow-Vertex Connection Number [rvcn] is computed for some graphs by the researchers. Here we have considered the subdivision graphs of certain graph classes. The rainbow edge connection number of subdivision of Triangular snake graph was already found[1].
null Dechamma K. K. +1 more
openaire +1 more source
Rainbow Vertex Connection Number pada Keluarga Graf Roda
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2022 The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with ...
Firman Firman +2 more
openaire +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
Rainbow Vertex-Connection Number [PDF]
, 2012 All the above parameters on rainbow connections involved edge-colorings of graphs. A natural idea is to introduce a similar parameter involving vertex-colorings of graphs. It is, as mentioned above, a vertex version of the rainbow connection number. Krivelevich and Yuster (J.
Xueliang Li, Yuefang Sun
openaire +1 more source
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 +1 more source
Local strong rainbow connection number of corona product between cycle graphs
Indonesian Journal of Combinatorics, 2023 A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj +1 more source
The rainbow vertex connection number of ladder graphs and Roach graphs
Ceylon Journal of Science, 2023 A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on
W. D. D. P. Dewananda +1 more
openaire +1 more source