Abstract
We discuss relationships amongT-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral setTthat contains 0, the asymptoticT-coloring ratioR(T) is equal to the fractional chromatic number of the distance graphG(Z, D), whereD=T−{0}. This fact is then used to study the distance graphs with distance sets of the formDm, k={1, 2, …, m}−{k}. The chromatic numbers and the fractional chromatic numbers ofG(Z, Dm, k) are determined for all values ofmandk. Furthermore, circular chromatic numbers ofG(Z, Dm, k) for some special values ofmandkare obtained.
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.
