Abstract
The insight of labeling to the vertices and edges in graphs has flourished with types of labeling being applied in different areas by the researchers. Prominent among the types of labeling is Prime labeling and square difference labeling, of graphs. In this paper we show the admittance of Prime labeling and square difference labeling for few finite, simple, connected and undirected graphs.
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 callDisclaimer: 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.
