Prime Coloring of Crossing Number Zero Graphs

Abstract

In this paper, prime coloring and its chromatic number of some crossing number zero graphs are depicted and its results are vali-dated with few theorems. Prime Coloring is defined as G be a loop less and Without multiple edges with n distinct Vertices on Color class C={c1,c2,c3,…..cn} a bijection ψ:V {c1,c2,c3,…..cn} if for each edge e = cicj ,i≠j , gcd{ ψ (ci), ψ (cj)}=1, ψ (ci) and ψ (cj) receive distinct Colors. The Chromatic number of Prime coloring is minimum cardinality taken by all the Prime colors. It is denoted by η (G).