Abstract
A graph G = (V(G), E(G)) is observed to admit prime labeling, if a graph that receives prime labeling is called prime graph .In this research article we investigate that the Nauru graph admits prime labeling. We construct the mirror graph and shadow graph of the Nauru graph. We also establish prime labeling using some graph operations such as duplication. switching and fusion with few ideas.
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: International Journal For Multidisciplinary Research
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.
