Let be a simple connect graph on a finite vertex set and let be its adjacency matrix. Then is said to be if and only if is an eigenvalue of The of denoted by is the \textit{algebraic multiplicity} of the eigenvalue in the spectrum of The general problem of characterising singular graphs is easy to state but it seems too difficult in this time. In this work, we investigate this problem for finite graphs on which the dihedral group acts vertex transitively as group of automorphisms. We determine the nullity of such graphs. We show that Cayley graphs over dihedral groups is non-singular if $|H \cap C_{p^s}|\neq |H \cap C_{p^s}b||H|<pps \in .$

生成讲解博客的中文版本

生成AI智能校验的中文版本