Singular Graphs on which the Dihedral Group Acts Vertex Transitively
Abstract
Let be a simple connect graph on a finite vertex set V and let A be its adjacency matrix. Then is said to be singular if and only if 0 is an eigenvalue of A. The nullity (singularity) of , denoted by null(), is the algebraic multiplicity of the eigenvalue 0 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 Dn acts vertex transitively as group of automorphisms. We determine the nullity of such graphs. We show that Cayley graphs over dihedral groups Dps is non-singular if |H Cps|≠ |H Cpsb| and |H|<p where p is a prime number and s ∈ N.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.