arXiv Analytics

Sign in

arXiv:1912.04740 [math.CO]AbstractReferencesReviewsResources

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

C. Dalfó, M. A. Fiol, S. Pavlíková, J. Širáň

Published 2019-12-08Version 1

The universal adjacency matrix $U$ of a graph $\Gamma$, 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_1 A+c_2 D+c_3 I+ c_4 J$, with $c_i\in {\mathbb R}$ and $c_1\neq 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).

Comments: arXiv admin note: text overlap with arXiv:1903.10776
Categories: math.CO
Subjects: 05C20, 05C50, 15A18
Related articles: Most relevant | Search more
arXiv:1903.10776 [math.CO] (Published 2019-03-26)
Spectra and eigenspaces of arbitrary lifts of graphs
arXiv:2012.04020 [math.CO] (Published 2020-12-07)
$λ$-Core Distance Partitions
arXiv:2105.10903 [math.CO] (Published 2021-05-23)
On the $A_α$ spectral radius of strongly connected digraphs