Affiliation:
1. Universität Hildesheim, Institut für Mathematik und Angewandte Informatik, Hildesheim, Germany
2. Fakultät für Informatik Ostfalia Hochschule für angewandte Wissenschaften, Wolfenbüttel, Germany
Abstract
Each integral circulant graph ICG(n,D) is characterised by its order n and a
set D of positive divisors of n in such a way that it has vertex set Z=nZ and
edge set {(a,b) : a, b ? Z=nZ, gcd(a - b,n) ? D}. According to a conjecture
of So two integral circulant graphs are isomorphic if and only if they are
isospectral, i.e. they have the same eigenvalues (counted with
multiplicities). We prove a weaker form of this conjecture, namely, that two
integral circulant graphs with multiplicative divisor sets are isomorphic if
and only if their spectral vectors coincide.
Publisher
National Library of Serbia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献