Edge Prime Labeling of M(Cn)

Author(s): Ezhil A and Rekha D

Abstract:

A Graph G = (N,L) with ‘s’ nodes and ‘t’ lines is known as vertex prime labeling. A notation of vertex prime labeling(VPL). Line of the graphs are labeled from the set of natural numbers. If for every node of degree at least 2 the GCD(Greatest Common Divisor) of the labels on its incident line is 1. A vertex prime graph is a Graph G that allows vertex prime labeling. we discuss Multicycles are intersecting at a single node. In this paper the vertex prime labeling of Multicycle Graphs Ϻ(Cn) is proved.

keywords:

Pages: 76-79     |    1 View     |    0 Download