English

Polynomial Relations Between Matrices of Graphs

Combinatorics 2017-09-07 v2 Spectral Theory

Abstract

We derive a correspondence between the eigenvalues of the adjacency matrix AA and the signless Laplacian matrix QQ of a graph GG when GG is (d1,d2)(d_1,d_2)-biregular by using the relation A2=(Qd1I)(Qd2I)A^2=(Q-d_1I)(Q-d_2I). This motivates asking when it is possible to have Xr=f(Y)X^r=f(Y) for ff a polynomial, r>0r>0, and X, YX,\ Y matrices associated to a graph GG. It turns out that, essentially, this can only happen if GG is either regular or biregular.

Keywords

Cite

@article{arxiv.1706.03298,
  title  = {Polynomial Relations Between Matrices of Graphs},
  author = {Sam Spiro},
  journal= {arXiv preprint arXiv:1706.03298},
  year   = {2017}
}

Comments

16 pages

R2 v1 2026-06-22T20:15:07.910Z