Hardness results and spectral techniques for combinatorial problems on circulant graphs Original Research Article

We show that computing (and even approximating) image and image for circulant graphs is essentially as hard as in the general case. In contrast, we show that, under additional constraints, e.g., prime order and/or sparseness, image and image become easier in the circulant case, and we take advantage of spectral techniques for their efficient computation.