Prime coloring of unit distance and non crossing graphs

In the recent era, the coloring of the graphs is arousing the attention of researchers. Among the mathematical models, coloring technique plays a vital role in a broad range of applications in real life problems and it solves several complexities of computer networks. In this paper, prime coloring and its chromatic number of unit distance and non crossing Graphs are depicted and its results are validated with few theorems.