Abstract
A labeling or numbering of a graph G is an assignment of labels to the vertices of G that induces for each edge uv a labeling depending on the vertex labels f(u) and f(v). In this paper, neighborhood prime labeling of Star graph, Complete bipartite graph, Fan graph, Friendship graph, Flower graph, Bistar graph, Comb graph, splitting graph of Pn and Splitting graph of K1,n are discussed. Also discuss the neighborhood prime labeling in Ring sum of cycle Cn and K1,n and some graph operations on the Fan graph and Friendship graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.