Abstract
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels. In this paper we investigate prime labeling for web graphs without center and graphs resulting from the subdivision of some specific edges in it. We also derive some interesting results on prime labeling of union of web graph without center with wheel graph, generalized Jahangir graph and drum graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
