PRIME LABELING OF DESARGUES GRAPHS

A graph with vertex set V is said to have a prime labeling if its vertices are labeled with distinct integers 1,2,…|V| such that for edge  the labels assigned to x and y are relatively prime. A graph which admits prime labeling is called a prime graph. In this paper I investigate prime labeling for some special graphs namely Desargues graph. I also discuss prime labeling in the context of graph operations namely duplication and switching in Desargues graph.