New Type of Results on Prime Graphs

M. Simaringa and S. Thirunavukkarasu

Let be a graph. A bijection | | is called prime labeling if for any two adjacent vertices such that . Then the graph is called prime graph. In this paper, we prove that new type of results on prime graphs.

Volume 12 | Issue 8

Pages: 33-50

DOI: 10.5373/JARDCS/V12I8/20202444