The rainbow vertex connection number of ladder graphs and Roach graphs
Abstract
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. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on deriving formulas for the rainbow vertex connectivity number of a simple ladder graph and a roach graph.
DOI: https://doi.org/10.4038/cjs.v52i3.8045 | Journal eISSN: 2513-230X
Language: English
Page range: 305 - 308
Published on: Sep 1, 2023
Published by: Faculty of Science, University of Peradeniya, Sri Lanka
In partnership with: Paradigm Publishing Services
© 2023 W. D. D. P. Dewananda, K. K. K. R. Perera, published by Faculty of Science, University of Peradeniya, Sri Lanka
This work is licensed under the Creative Commons Attribution 4.0 License.