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

Abstract

The universal adjacency matrix U of a graph , with adjacency matrix A, is a linear combination of A, the diagonal matrix D of vertex degrees, the identity matrix I, and the all-1 matrix J with real coefficients, that is, U=c1 A+c2 D+c3 I+ c4 J, with ci∈ R and c1≠ 0. Thus, as particular cases, U 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).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…