Integral Cayley graphs defined by greatest common divisors
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

An undirected graph is called integral, if all of its eigenvalues are integers. Let $\Gamma =Z_{m_1}\otimes \ldots \otimes Z_{m_r}$ be an abelian group represented as the direct product of cyclic groups $Z_{m_i}$ of order $m_i$ such that all greatest common divisors $\gcd(m_i,m_j)\leq 2$ for $i\neq j$. We prove that a Cayley graph $Cay(\Gamma,S)$ over $\Gamma$ is integral, if and only if $S\subseteq \Gamma$ belongs to the the Boolean algebra $B(\Gamma)$ generated by the subgroups of $\Gamma$. It is also shown that every $S\in B(\Gamma)$ can be characterized by greatest common divisors.
DOI : 10.37236/581
Classification : 05C25, 05C50
@article{10_37236_581,
     author = {Walter Klotz and Torsten Sander},
     title = {Integral {Cayley} graphs defined by greatest common divisors},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/581},
     zbl = {1217.05105},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/581/}
}
TY  - JOUR
AU  - Walter Klotz
AU  - Torsten Sander
TI  - Integral Cayley graphs defined by greatest common divisors
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/581/
DO  - 10.37236/581
ID  - 10_37236_581
ER  - 
%0 Journal Article
%A Walter Klotz
%A Torsten Sander
%T Integral Cayley graphs defined by greatest common divisors
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/581/
%R 10.37236/581
%F 10_37236_581
Walter Klotz; Torsten Sander. Integral Cayley graphs defined by greatest common divisors. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/581

Cité par Sources :