Results 1 to 10 of about 9,765,356 (168)

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   +3 more sources

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

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   +3 more sources

The Vertex-Rainbow Connection Number of Some Graph Operations [PDF]

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   +3 more sources

RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ]) [PDF]

Barekeng
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi, Robiatul Adawiyah, Dafik Dafik, I Nengah Suparta   +3 more
doaj   +3 more sources

The Rainbow (Vertex) Connection Number of Pencil Graphs [PDF]

Procedia Computer Science, 2015
An edge colored graph G = (V(G), E(G)) is said rainbow connected, if any two vertices are connnected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the smallest positive integer of colors needed in ...
D. N. S. Simamora, A. Salman
exaly   +3 more sources

THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS [PDF]

Barekeng
Let  be a nontrivial simple connected graph,  be an edge of  and  be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled  such that .
Ratnaning Palupi, A. N. M. Salman
doaj   +3 more sources

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

The Rainbow Vertex-Connection Number of Star Fan Graphs

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2018
A vertex-colored graph  is said to be rainbow vertex-connected, if for every two vertices  and  in , there exists a  path with all internal vertices have distinct colors.
Ariestha Widyastuty Bustan, A.N.M. Salman   +1 more
doaj   +2 more sources

Rainbow vertex connection of digraphs [PDF]

Journal of Combinatorial Optimization, 2017
An edge-coloured path is rainbow if its edges have distinct colours. An edge-coloured connected graph is said to be rainbow connected if any two vertices are connected by a rainbow path, and strongly rainbow connected if any two vertices are connected by
Yongtang Shi
exaly   +3 more sources

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   +2 more sources