Let $G$ be a non-trivial group, $S\subseteq G\setminus \{1\}$ and $S=S^{-1}:=\{s^{-1} \;|\; s\in S\}$. The Cayley graph of $G$ denoted by $\Gamma(S:G)$ is a graph with vertex set $G$ and two vertices $a$ and $b$ are adjacent if $ab^{-1}\in S$. A graph is called integral, if its adjacency eigenvalues are integers. In this paper we determine all connected cubic integral Cayley graphs. We also introduce some infinite families of connected integral Cayley graphs.
We associate a graph ΓG to a nonlocally cyclic group G (called the noncyclic graph of G) as follows: take G\ Cyc(G) as vertex set, where Cyc(G) = {x ∊ G| 〈x, y〉 is cyclic for all y ∊ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of ΓG is finite if and only if ΓG has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with ΓG ≅ ΓH and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose noncyclic graphs are “unique”, i.e., if ΓG ≅ ΓH for some group H, then G ≅ H. In view of these examples, we conjecture that every finite nonabelian simple group has a unique noncyclic graph. Also we give some examples of finite noncyclic groups G with the property that if ΓG ≅ ΓH for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite noncyclic groups.
We associate a graph 𝒩G with a group G (called the non-nilpotent graph of G) as follows: take G as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this article, we study the graph theoretical properties of 𝒩G and its induced subgraph on G \ nil(G), where nil(G) = {x ∈ G | ⟨ x, y ⟩ is nilpotent for all y ∈ G}. For any finite group G, we prove that 𝒩G has either |Z*(G)| or |Z*(G)| +1 connected components, where Z*(G) is the hypercenter of G. We give a new characterization for finite nilpotent groups in terms of the non-nilpotent graph. In fact, we prove that a finite group G is nilpotent if and only if the set of vertex degrees of 𝒩G has at most two elements.