Abstract
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinary chromatic number of a graph. We say a graph G is star-extremal if its star-chromatic number is equal to its fractional-chromatic number. We prove that star-extremal graphs G have the following interesting property: For an arbitrary graph H the star-chromatic number χ ⋆(G[H]) of the lexicographic product G[ H] is equal to the product of χ ⋆( G) and χ( H). Then we show that several classes of circulant graphs are star-extremal. Thus for these circulant graphs G and arbitrary graphs H, if χ ⋆( G) and χ( H) are known then we can easily determine the star-chromatic number (hence the ordinary chromatic number) of the lexicographic product G[ H]. For these star-extremal circulant graphs, we also derive polynomial-time anti-clique-finding and coloring algorithms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
