The Electronic Journal of Combinatorics · 2010 · 68 citations · 9 references
Natural SciencesMathematicsAlgebraCombinatoricsRepresentation TheoryAbstract AlgebraDirected Acyclic GraphsGraph TheoryGroup TheoryAlgebraic Graph Theory
Let $\Gamma$ be a finite, additive group, $S \subseteq \Gamma, 0\notin S, -S=\{-s: s\in S\}=S$. The undirected Cayley graph Cay$(\Gamma,S)$ has vertex set $\Gamma$ and edge set $\{\{a,b\}: a,b\in \Gamma$, $a-b \in S\}$. A graph is called integral, if all of its eigenvalues are integers. For an abelian group $\Gamma$ we show that Cay$(\Gamma,S)$ is integral, if $S$ belongs to the Boolean algebra $B(\Gamma)$ generated by the subgroups of $\Gamma$. The converse is proven for cyclic groups. A finite group $\Gamma$ is called Cayley integral, if every undirected Cayley graph over $\Gamma$ is integral. We determine all abelian Cayley integral groups.
9
László Babai · Journal of Combinatorial Theory Series B · 1979 · 220 citations
Wasin So · Discrete Mathematics · 2006 · 138 citations
Omran Ahmadi, Noga Alon, Ian F. Blake et al. · Linear Algebra and its Applications · 2008 · 86 citations
Natural Sciences, Architectural Representation, Combinatorics +6