Abstract
Let be a group and its subset such that , where . Then {\it the Cayley graph } is an undirected graph with the vertex set and the edge set . A graph is said to be {\it integral} if every eigenvalue of the adjacency matrix of is integer. In the paper, we prove the following theorem: {\it if a subset of is normal and for every such that , then is integral.} In particular, {\it if is a normal set of involutions, then is integral.} We also use the theorem to prove that {\it if and , then is integral.} Thus, we give positive solutions for both problems 19.50(a) and 19.50(b) in "Kourovka Notebook".
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.