Abstract
A vertex-colored graphG= (V(G), E(G)) is said a rainbow vertex-connected, if for every two verticesuandvinV(G), there exist auâvpath with all internal vertices have distinct colors. The rainbow vertex-connection number ofG, denoted byrvc(G), is the smallest number of colors needed to makeGrainbow vertex-connected. Letnis integers at least 2, Bnis a brush graph with 2nvertices. In this paper, we determine the rainbow vertex connection number of square, glue, middle and splitting graph of brush graph.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Helmi, H., Vilgalita, B. G., Fran, F., & Putra, D. R. (2020). Rainbow vertex connection number of square, glue, middle and splitting graph of brush graph. In AIP Conference Proceedings (Vol. 2268). American Institute of Physics Inc. https://doi.org/10.1063/5.0017092
Readers over time
Readers' Seniority
Readers' Discipline
