Dergiler / Communications Faculty of Sciences University of Ankara Series A1: Mathematics and Statistics / 2020 / Cilt: 69 - Sayı: 2
ON STAR COLORING OF MODULAR PRODUCT OF GRAPHS
- Sayfa
- 1235–1239
- DOI
- —
Abstract
A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number s (G) of G is the least number of colors needed to star color G. In this paper, we find the exact values of the star chromatic number of modular product of complete graph with complete graph Km o Kn, path with complete graph Pm o Kn and star graph with complete graph K1,m o Kn.