Singular Graphs with Dihedral Group Action
Combinatorics
2020-06-24 v1
Abstract
Let be a simple undirected graph on a finite vertex set and let be its adjacency matrix. Then is {\it singular} if is singular. The problem of characterising singular graphs is easy to state but very difficult to resolve in any generality. In this paper we investigate the singularity of graphs for which the dihedral group acts transitively on vertices as a group of automorphisms.
Cite
@article{arxiv.2006.12875,
title = {Singular Graphs with Dihedral Group Action},
author = {Ali Sltan Ali AL-Tarimshawy and J. Siemons},
journal= {arXiv preprint arXiv:2006.12875},
year = {2020}
}