pith. sign in

arxiv: 1706.03298 · v2 · pith:PLLESNNRnew · submitted 2017-06-11 · 🧮 math.CO · math.SP

Polynomial Relations Between Matrices of Graphs

classification 🧮 math.CO math.SP
keywords biregulargraphmatricesmatrixpolynomialwhenadjacencyasking
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.