Back to Search
Start Over
Singular graphs with dihedral group action
- Source :
- Discrete Mathematics. 344:112119
- Publication Year :
- 2021
- Publisher :
- Elsevier BV, 2021.
-
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.
- Subjects :
- Discrete mathematics
MathematicsofComputing_GENERAL
MathematicsofComputing_NUMERICALANALYSIS
020206 networking & telecommunications
0102 computer and information sciences
02 engineering and technology
Dihedral group
Automorphism
01 natural sciences
Theoretical Computer Science
Vertex (geometry)
Combinatorics
Singularity
010201 computation theory & mathematics
Data_GENERAL
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
FOS: Mathematics
0202 electrical engineering, electronic engineering, information engineering
Mathematics - Combinatorics
Discrete Mathematics and Combinatorics
Combinatorics (math.CO)
Adjacency matrix
Undirected graph
MathematicsofComputing_DISCRETEMATHEMATICS
Mathematics
Subjects
Details
- ISSN :
- 0012365X
- Volume :
- 344
- Database :
- OpenAIRE
- Journal :
- Discrete Mathematics
- Accession number :
- edsair.doi.dedup.....0ac4e52bce47f354d1a31ce5c8442345