Abstract

Let Γ be a simple undirected graph on a finite vertex set and let A be its adjacency matrix. Then Γ is singular if A is singular. The problem of characterizing 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call