Abstract
In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple graphs G and H.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
