ON STAR COLOURING OF M(TM,N),M(TN),M(LN) AND M(SN)
Keyword(s):
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.
Keyword(s):
2011 ◽
Vol Vol. 13 no. 3
(Graph and Algorithms)
◽
Keyword(s):
2012 ◽
Vol 49
(2)
◽
pp. 156-169
◽
2018 ◽
Vol 7
(4.10)
◽
pp. 393
2018 ◽
Vol 2
(1)
◽
pp. 30
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 1
(Graph Theory)
◽
Keyword(s):