Abstract
Let n,a1,a2,…,ak be distinct positive integers. A finite Toeplitz graph Tn(a1,a2,…,ak)=(V,E) is a graph where V={v0,v1,…,vn−1} and E={vivj, for |i−j|∈{a1,a2,…,ak}}. In this paper, we first refine some previous results on the connectivity of finite Toeplitz graphs with k=2, and then focus on Toeplitz graphs with k=3, proving some results about their chromatic number.
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.
