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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.