Results 1 to 10 of about 208 (119)

Rainbow connections of bioriented graphs [PDF]

Heliyon
For 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 vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4))

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, Muhammad Rifai Katili, Salmun K. Nasib, Nisky Imansyah Yahya   +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, Ika Hesti Agustin, Dafik Dafik, Elsa Yuli Kurniawati   +3 more
doaj   +1 more source

RAINBOW VERTEX-CONNECTION NUMBER ON COMB PRODUCT OPERATION OF CYCLE GRAPH (C_4) AND COMPLETE BIPARTITE GRAPH (K_(3,N))

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, Ainun Fatmawati, Nurwan Nurwan, Salmun K Nasib   +3 more
doaj   +1 more source

Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Jambura Journal of Mathematics, 2022
Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph.
Indrawati Lihawa, Sumarno Ismail, Isran K Hasan, Lailany Yahya, Salmun K Nasib, Nisky Imansyah Yahya   +5 more
doaj   +1 more source

On the study of Rainbow Antimagic Coloring of Special Graphs

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023
Let  be a connected graph with vertex set  and edge set . The bijective function  is said to be a labeling of graph where  is the associated weight for edge .
Dafik Dafik, Riniatul Nur Wahidah, Ermita Rizki Albirri, Sharifah Kartini Said Husain   +3 more
doaj   +1 more source

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   +1 more source

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, Liliek Susilowati, Dafik Dafik, M. Venkatachalam   +3 more
doaj   +1 more source

ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n ) AND THE LOTUS GRAPH(Lo_n )

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, I I Makhfudloh, Dafik Dafik, RM Prihandini, AC Prihandoko   +4 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