A comparative study on prime and vertex k-prime labeling of one point union of path graphs

Abstract

In our study, we investigate the structure of one point union of path graphs and prove that they admit a vertex k-prime labeling. Further a study on comparison between prime and vertex k-prime labeling for one point union of path graph has been analysed and applied in the field of computer science with the help of C++ programming language.