Coloring In Semigraph

Authors

  • D. Narmatha , N. Murugesan, D. Indhumathy

Abstract

Graph coloring is an interesting research area in graph theory. Over the years various types of
coloring 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. The
studies of semigraphs with new variants in dominations and coloring may yield a lot of applications in many
practical situations. The chromatic number of Cartesian product of path semigraphs have been discussed in
this paper.

Published

2020-11-01

Issue

Section

Articles