Results 21 to 30 of about 7,406 (155)
Rainbow Vertex Connection Number pada Keluarga Graf Roda
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2022 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 +2 more sources
The Rainbow-Vertex Connection Number [RVCN] of Subdivision of Certain Graphs
International Journal of Scientific Research in Science, Engineering and Technology, 2022 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[
Dechamma K. K., Dr. Rajanna K. R.
semanticscholar +2 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
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.
A. W. Bustan, A. Salman
semanticscholar +2 more sources
Further hardness results on the rainbow vertex-connection number of graphs [PDF]
Theoretical Computer Science, 2011 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.
Lily Chen, Xueliang Li, Huishu Lian
semanticscholar +4 more sources
The rainbow vertex connection number of edge corona product graphs
IOP Conference Series: Earth and Environmental Science, 2019 Let G1, G2 be a special graphs with vertices of G1 1,2,…, n and edges of G1 1,2,… m. The generalized edge corona product of graphs G1 and G2, denoted by G1 ⋄ G1 is obtained by taking one copy of graph G1 and m copy of G2, thus for each edge ek = ij of G,
D. A. Fauziah +3 more
semanticscholar +2 more sources
Generalized Rainbow Connection of Graphs and their Complements
Discussiones Mathematicae Graph Theory, 2018 Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +3 more sources
On the (Strong) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product
Journal of Physics: Conference Series, 2018 The vertex-colored graph G = (V, E) is said rainbow vertex-connected, if for every two vertices u and v in V, there is a u − v path with all internal vertices have distinct color.
Dafik, Slamin, Agustina Muharromah
semanticscholar +2 more sources
Rainbow connection number of amalgamation of some graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +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