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 and the signless Laplacian matrix of a graph when is -biregular by using the relation . This motivates asking when it is possible to have for a polynomial, , and matrices associated to a graph . It turns out that, essentially, this can only happen if is either regular or biregular.
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