RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ]) [PDF]
BarekengThe 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 +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 +2 more sources
Further hardness results on the rainbow vertex-connection number of graphs
Theoretical Computer Science, 2013 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. The {\it rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in ...
Lily Chen, Xueliang Li, Huishu Lian
exaly +6 more sources
Bilangan Rainbow Connection dari Hasil Operasi Penjumlahan dan Perkalian Kartesius Dua Graf [PDF]
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2012 Graf dengan pewarnaan sisi disebut pelangi sisi terhubung, jika setiap titik pada graf dihubungkan oleh lintasan yang memiliki sisi-sisi dengan warna yang berbeda. Rainbow connection pada graf yang terhubung, disimbolkan oleh yaitu bilangan terkecil dari
Fuad Adi Saputra
doaj +2 more sources
A Study on Strong Rainbow Vertex-Connection in Some Classes of Generalized Petersen Graphs
Procedia Computer Science, 2020 Abstract 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 distinct vertices. The strong rainbow vertex-connection number, represented by srvc(G) is
Helda Mercy M, I. Annammal Arputhamary
exaly +2 more sources
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS [PDF]
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +2 more sources
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sujuan Liu, Xueliang Li
exaly +2 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. The rainbow vertex connection number of G, denoted by rvc(G), is the minimum number of colors required to make G rainbow-vertex connected. In this paper, we determine the
E. M. C. Wattimena +3 more
openaire +2 more sources
Rainbow vertex-connection number on a small-world Farey graph
AKCE International Journal of Graphs and Combinatorics, 2022 Wipawee Tangjai, Chayapa Darayon
exaly +2 more sources
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 +3 more
doaj +1 more source