paper

A note on the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs

arXiv:1912.04740

Abstract

The universal adjacency matrix of a graph , with adjacency matrix , is a linear combination of , the diagonal matrix of vertex degrees, the identity matrix , and the all-1 matrix with real coefficients, that is, , with and . Thus, as particular cases, may be the adjacency matrix, the Laplacian, the signless Laplacian, and the Seidel matrix. In this note, we show that basically the same method introduced before by the authors can be applied for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not).

arXiv admin note: text overlap with arXiv:1903.10776