Vol. 5 No. 2 (2018): Vol 5, Iss 2, Year 2018
Articles
Published
December 30, 2018
Keywords
- Star coloring, Star chromatic number, Middle graph.
How to Cite
V, L., D, V., & S, P. (2018). ON STAR COLOURING OF M(TM,N),M(TN),M(LN) AND M(SN). Kongunadu Research Journal, 5(2), 7-10. https://doi.org/10.26524/krj262
Abstract
A Star coloring of an undirected graph G is a proper vertex coloring of G in which every path on four vertices contains at least three distinct colors. The Star chromatic number of an undirected graph Χs(G), denoted by(G) is the smallest integer k for which G admits a star coloring with k colors. In this paper, we obtain the exact value of the Star chromatic number of Middle graph of Tadpole graph, Snake graph, Ladder graph and Sunlet graphs denoted by M(Tm,n), M(Tn),M(Ln) and M(Sn) respectively.
Downloads
Download data is not yet available.