CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Analisis rainbow vertex connection pada beberapa graf khusus dan operasinya

Ida Ariska (Universitas Jember)
Ika Hesti Agustin (Universitas Jember)
Kusbudiono Kusbudiono (Universitas Jember)

Article Info

Publish Date
05 Oct 2022

Abstract

The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected. On this research, will be raised the issue of how to produce graphs the results of some special graph and how to find the rainbow vertex connection. Operation that use cartesian product, crown product, and shackle. Theorem in this research rainbow vertex connection number in graph the results of operations Wd3,m □ Pn,,Wd3,m ⵙ Pn, and shack(Btm,v,n).

Copyrights © 2022




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Website

Abbrev

cgant

Publisher

Universitas Jember

Subject

Computer Science & IT Other

Description

Subjects suitable for publication include, the following fields of: Degree Diameter Problem in Graph Theory Large Graphs in Computer Science Mathematical Computation of Graph Theory Graph Coloring in Atomic and Molecular Graph Labeling in Coding Theory and Cryptography Dimensions of graphs on ...