On the reduced Euler characteristic of independence complexes of circulant graphs
Combinatorics
2018-07-17 v5
Abstract
Let be the circulant graph with . We study the reduced Euler characteristic of the independence complex for with prime and for with odd prime, proving that in both cases does not vanish. We also give an example of circulant graph whose independence complex has equals to , giving a negative answer to R. Hoshino.
Keywords
Cite
@article{arxiv.1706.00863,
title = {On the reduced Euler characteristic of independence complexes of circulant graphs},
author = {Giancarlo Rinaldo and Francesco Romeo},
journal= {arXiv preprint arXiv:1706.00863},
year = {2018}
}