Prime Labeling of Multicycle Graphs

Author(s): Ezhil A and Rekha D

Abstract:

G= (V, E), a graph of ‘P’ vertices. and 'q' edges is said to have a prime labeling if pvertices. are labeled with distinct Positive integers 1,2, 3....p that do not exceed "p", so that reach pair of neighboring Vertices u and v are co-prime, A prime Graph (PG) is a graph G that admits prime labeling, graph labeling is an important area of research in Graph Theory (GT). There are many types of graphs labeling and other different labeling techniques.In this work, examine Whether Multicycle graphs M (Cń) have prime labeling We also discuss Prime Labeling in the context of some graph operations namely cycle and Path.

keywords:

Pages: 91-93     |    3 View     |    0 Download