Regularity and the generalized adjacency spectra of graphs (Q2496664): Difference between revisions

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\).