LINEAR PRIME LABELING OF SOME PATH RELATED DI GRAPHS
Abstract
Author(s): Sunoj B S*, Mathew Varkey T K
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct edges with twice the value of the terminal vertex plus value of the initial vertex. The greatest com mon incidence number of a vertex (gcin) of in degree greater than one is defined as the greatest common divisor of the labels of the incident edges[5]. If the gcin of each vertex of in degree greater than one is one, then the graph admits linear prime labeling[6]. Here we investigate some path related di graphs for linear prime labeling.
