Abstract
In this paper first, we give a brief introduction about integer distance graphs. An integer distance graph is a graph G(Z,D) with the set of integers as vertex set and an edge joining two vertices u and v if and only if |u − v| ∈ D where D is a subset of the positive integers. If D is a subset of P then we call G(Z,D) a prime distance graph. Second, we obtain a partial solution to a general open problem of characterizing a class of prime distance graphs. Third, we compute the vertex arboricity of certain prime distance graphs. Fourth, we give a brief review regarding circulant graphs and highlight its importance in the computation of chromatic number of distance graphs with appropriate references. Fifth, we introduce the notion of pseudochromatic coloring and obtain certain results concerning circulant graphs and distance graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Pure and Apllied Mathematics
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.