On circulant nut graphs

A nut graph is a simple graph whose adjacency matrix has the eigenvalue 0 with multiplicity 1 such that its corresponding eigenvector has no zero entries. Motivated by a question of Fowler et al. (2020) [5] to determine the pairs (n,d) for which a vertex-transitive nut graph of order n and degree d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Linear algebra and its applications 2022-01, Vol.633, p.127-151
Hauptverfasser:	Damnjanović, Ivan, Stevanović, Dragan
Format:	Artikel
Sprache:	eng
Schlagworte:	Circulant graphs Cyclotomic polynomials Eigenvalues Eigenvectors Graph eigenvalues Graphs Linear algebra
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!