Back to Search
Start Over
ON STAR COLORING OF LEXICOGRAPHIC PRODUCT OF GRAPHS.
- Source :
- Acta Universitatis Apulensis: Mathematics-Informatics; 2021, Issue 67, p49-59, 11p
- Publication Year :
- 2021
-
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 X<subscript>s</subscript> (G) of G is the least number of colors needed to star color G. In this paper, we determine the star chromatic number of lexicographic product of complete graph with complete graph K<subscript>m</subscript>[K<subscript>n</subscript>], complete graph with wheel graph K<subscript>m</subscript>[W<subscript>n</subscript>], complete graph with path Km[P<subscript>n</subscript>] and path with path P<subscript>m</subscript>[P<subscript>n</subscript>]. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15825329
- Issue :
- 67
- Database :
- Complementary Index
- Journal :
- Acta Universitatis Apulensis: Mathematics-Informatics
- Publication Type :
- Academic Journal
- Accession number :
- 153490741
- Full Text :
- https://doi.org/10.17114/j.aua.2021.67.05