Results 11 to 20 of about 303 (159)
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
BAREKENG: Jurnal Ilmu Matematika dan TerapanLet 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 .
Palupi, Ratnaning +3 more
core +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
Determining the Locating Rainbow Connection Number of Vertex-Transitive Graphs
The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex path and every vertex has a distinct rainbow code.
Putri, Pritta Etriana +2 more
core +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.
Tilukay, Meilin I. +3 more
core +2 more sources
BAREKENG: Jurnal Ilmu Matematika dan TerapanThe 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.
Suparta, I Nengah +3 more
core +3 more sources
Rainbow vertex-connection number on a small-world Farey graph
AKCE International Journal of Graphs and Combinatorics, 2022 Chayapa Darayon, Wipawee Tangjai
exaly +2 more sources
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
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 ...
Kutucu H., Nuriyeva F., Ugurlu O.
core +5 more sources
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
The Rainbow Vertex-Connection Number of Star Fan Graphs [PDF]
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. The rainbow vertex connection number of , denoted by is the smallest number of colors needed to make rainbow vertex connected.
Ariestha Widyastuty Bustan +1 more
openaire +2 more sources