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

2019/12/08 by Dalfó, C., Fiol, M. A., Pavlíková, S. +1
#05C20 #05C50 #15A18 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1912.04740

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=c₁ A+c₂ D+c₃ I+ c₄ J, with c_i∈ \mathbb R and c₁≠ 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).

Related

• Spectra and eigenspaces of arbitrary lifts of graphs
• Universal spectra of the disjoint union of regular graphs
• Universal adjacency spectrum of (proper) power graphs and their complements on some groups
• On graphs with adjacency and signless Laplacian matrix eigenvectors entries in \-1, +1\
• Unifying adjacency, Laplacian, and signless Laplacian theories