Abstract
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. All graphs constructed here satisfy a certain extremal divisibility condition for the determinant of their walk matrix.
| Original language | English |
|---|---|
| Pages (from-to) | 1108-1112 |
| Number of pages | 5 |
| Journal | Discrete Mathematics |
| Volume | 342 |
| Issue number | 4 |
| Early online date | 14 Jan 2019 |
| DOIs | |
| Publication status | Published - Apr 2019 |
Keywords
- Graph spectrum
- Graphs determined by generalized spectrum
- Walk matrix
Profiles
-
Johannes Siemons
- School of Engineering, Mathematics and Physics - Emeritus Reader
- Algebra, Number Theory, Logic, and Representations (ANTLR) - Member
Person: Honorary, Research Group Member
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver