On the chromatic number of Toeplitz graphs

Citations of this article
Mendeley users who have this article in their library.


Let n,a1, a2,⋯, ak be distinct positive integers. A finite Toeplitz graph Tn(a1, a 2,⋯, 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. © 2011 Elsevier B.V. All rights reserved.




Nicoloso, S., & Pietropaoli, U. (2014). On the chromatic number of Toeplitz graphs. In Discrete Applied Mathematics (Vol. 164, pp. 286–296). https://doi.org/10.1016/j.dam.2011.07.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free