Article ID Journal Published Year Pages File Type
473880 Computers & Mathematics with Applications 2010 7 Pages PDF
Abstract

Integral circulant graphs are a generalization of unitary Cayley graphs, recently studied by Klotz and Sander. The integral circulant graph Xn(D)Xn(D) has vertices 0,1,…,n−10,1,…,n−1, and two vertices aa and bb are adjacent iff gcd(x−y,n)∈Dgcd(x−y,n)∈D, where D⊆{d:d∣n,1≤d

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
On the chromatic number of integral circulant graphs
Authors
, ,