Results on Prime labeling and square difference labeling of Graphs

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.