Research Article Open Access

Some Prime Labeling of Graph

Abstract

A graph G=(V(G), E(G)) with vertex set V is said to have a prime labeling if its vertices can be labeled with distinct positive integer 1,2,3 V such that for edge u v E(G), the labels assigned to u and v are relatively prime. A graph which admits prime labeling is called a prime graph. 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 different labeling techniques. In this paper we discuss prime labeling for some graphs.

We also discuss prime labeling in the related of some graph operations namely cycle, path, crown, Fan, star and wheel graph.

To read the full article Download Full Article | Visit Full Article