Results 21 to 30 of about 9,765,356 (168)
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS [PDF]
The 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
Rainbow vertex-connection number on a small-world Farey graph
Wipawee Tangjai, Chayapa Darayon
exaly +2 more sources
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
Sujuan Liu, Xueliang Li
exaly +2 more sources
On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion
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
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 +5 more
doaj +1 more source
The rainbow vertex connection number of ladder graphs and Roach graphs
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.
W. D. D. P. Dewananda, K. Perera
semanticscholar +1 more source
Rainbow Vertex Connection Number pada Keluarga Graf Roda
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.
Firman - Firman, D. Dafik, E. R. Albirri
semanticscholar +1 more source
On the study of Rainbow Antimagic Coloring of Special Graphs
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 +3 more
doaj +1 more source
The Rainbow-Vertex Connection Number [RVCN] of Subdivision of Certain Graphs
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[
K. K. Dechamma, K. Rajanna
semanticscholar +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
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

