Abstract
An integer distance graph is a graph G( D) with the set of integers as vertex set and with an edge joining two vertices u and v if and only if | u − v ∈ D where D is a subset of the positive integers. We determine the chromatic number χ( D) of G( D) for some finite distance sets D such as sets of consecutive integers and special sets of cardinality 4.
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.
