Prime Coloring of Crossing Number Zero Graphs

  • P. Murugarajan Veltech Ranga Sanku Arts College, Avadi, Chennai-62, India.
  • R. Aruldoss Government Arts College (A), Kumbakonam- 612 002, Chennai, India.
Keywords: Prime graph, Vertex Coloring, Prime Coloring


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,…} a bijection ψ:V {c1,c2,c3,…} 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).


Download data is not yet available.


Bondy, J. A and Murty U.S.R (1976), Graph Theory with Applications, Macmillan, London.
Galian, J. A (2009), A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics, 16, #DS6.
Lee, S.M, Wui, J., Yeh, I(1988), On the Amalgamation Of Prime Graphs, Bull, Malaysian, Math.Soc. (Second Series), 11 , 59-67
Oleg, P. (2007), Trees are Almost Prime, Discrete Mathematics Elsevier, 307, 1455-1462.
Thomas, K. (2005 ), Elementary Number Theory with Applications, Elsevier, 103-115.
Samir K. V., Udayan, M. P.(2012), Some New Results on Prime Graphs, Open Journal Of Discrete Mathematics, 2, 99-104,.
How to Cite
P. Murugarajan, and R. Aruldoss. 2019. “Prime Coloring of Crossing Number Zero Graphs”. Mathematical Journal of Interdisciplinary Sciences 8 (1), 15-19.