Coloring In Semigraph

Graph coloring is an interesting research area in graph theory. Over the years various types ofcoloring have been extensively studied by various researchers, on an arbitrary graph and also on special graphs.In this paper, the fundamental properties of domination and coloring have been studied for semigraphs. Thestudies of semigraphs with new variants in dominations and coloring may yield a lot of applications in manypractical situations. The chromatic number of Cartesian product of path semigraphs have been discussed inthis paper.