On the spectral Ádám property for circulant graphs

@article{Mans2002OnTS,
title={On the spectral {\'A}d{\'a}m property for circulant graphs},
author={Bernard Mans and Francesco Pappalardi and Igor E. Shparlinski},
journal={Discrete Mathematics},
year={2002},
volume={254},
pages={309-329}
}

We investigate a certain condition for isomorphism between circulant graphs (known as the Ad am property) in a stronger form by referring to isospectrality rather than to isomorphism of graphs. We describe a wide class of graphs for which the Ad am conjecture holds. We apply these results to establish an asymptotic formula for the number of non-isomorphic circulant graphs and connected circulant graphs. Circulant graphs arise in many applications including telecommunication networks, VLSI… CONTINUE READING