Nisky Imansyah Yahya, Ainun Fatmawati, Nurwan, Salmun K. Nasib
Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by rvc(G). The rainbow vertex connection number can be applied to graphs resulting from operations. One of the methods to create a new graph is to perform operations between two graphs. Thus, this research uses comb product operation to determine rainbow-vertex connection number resulting from comb product operation of cycle graph and complete bipartite graph (Formula presented). The research finding obtains the theorem of rainbow vertex-connection number at the graph of (Formula presented) while the theorem of rainbow vertex-connection number at the graph of (Formula presented). © 2023 Author(s).
Mathematics Department, Faculty of Mathematics and Natural Sciences, State University of Gorontalo, Jend Sudirman Street, Gorontalo, Gorontalo City, 96128, Indonesia
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock