English

Singular Graphs on which the Dihedral Group Acts Vertex Transitively

Combinatorics 2018-10-09 v1

Abstract

Let Γ\Gamma be a simple connect graph on a finite vertex set VV and let AA be its adjacency matrix. Then Γ\Gamma is said to be \textit{singular} if and only if 00 is an eigenvalue of A.A. The \textit{nullity (singularity)} of Γ,\Gamma, denoted by null(Γ),{\rm null}(\Gamma), is the \textit{algebraic multiplicity} of the eigenvalue 00 in the spectrum of Γ.\Gamma. 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 DnD_n acts vertex transitively as group of automorphisms. We determine the nullity of such graphs. We show that Cayley graphs over dihedral groups DpsD_{p^s} is non-singular if HCpsHCpsb|H \cap C_{p^s}|\neq |H \cap C_{p^s}b| and H<p|H|<p where pp is a prime number and sN.s \in \mathbb{N}.

Keywords

Cite

@article{arxiv.1810.03406,
  title  = {Singular Graphs on which the Dihedral Group Acts Vertex Transitively},
  author = {Ali Sltan Ali AL-Tarimshawy},
  journal= {arXiv preprint arXiv:1810.03406},
  year   = {2018}
}
R2 v1 2026-06-23T04:31:58.683Z