Vertex Prime Labeling of the Two Copies of Cycle Graphs

Author(s): Thenmozhi S and Karunakaran V

Abstract:

A graph with 'h' points and 't' lines µ1 = (M1ꓹ N1) is said to have a vertex prime labeling (VPL) if its lines can be labeled by unique integers from {1ꓹ2ꓹ3ꓹ…|N1|}, such that for every degree at least twoꓹ the greatest common divisor of the labels on its event lines one. A graph that admits VPL is called a vertex prime graph (VPG).  Graph labeling is an important area of research in Graph theory. There are many kinds of graph labeling such as Graceful labelingꓹ Magic labelingꓹ Prime labelingꓹ and other differend labeling techniques. In In this workꓹ we examine the VPG of two copies of Cycle (2Cq).

keywords:

Pages: 130-132     |    2 View     |    0 Download