Regularity and the generalized adjacency spectra of graphs (Q2496664): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: GAP / rank | |||
Normal rank |
Revision as of 00:22, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Regularity and the generalized adjacency spectra of graphs |
scientific article |
Statements
Regularity and the generalized adjacency spectra of graphs (English)
0 references
20 July 2006
0 references
The paper solves the following problem of van Dam and Haemers: Given a rational number \(x\in(0,1)\), construct a pair of graphs, one regular and the other nonregular with adjacency matrices \(A_1\) and \(A_2\), having the property that \(A_1-xJ\) and \(A_2-xJ\) have the same spectrum (where \(J\) is the all-ones matrix). The authors also give a construction of the smallest examples for some suitably chosen values of \(x\).
0 references
spectrum
0 references
eigenvalues
0 references