Polynomial relations between matrices of graphs

DOI10.1002/JGT.22401MaRDI QIDQ4629997zbMATH OpenOpenAlexWikidataFDO

Authors Sam Spiro

Publication date 28 March 2019

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.03298

zbMATH Keywords

spectral graph theorycombinatoricsbiregular graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

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_{1}I)(Q-d_{2}I)$. 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.

Recommendations

• Polynomials on graphs
• A relation between the Laplacian and signless Laplacian eigenvalues of a graph
• Signless Laplacians of finite graphs
• Signless Laplacian polynomial and characteristic polynomial of a graph
• Universal adjacency matrices with two eigenvalues

Cited in

(4)

• scientific article; zbMATH DE number 7200914 (Why is no real title available?)
• Polynomial identities of Euler's graphs and matrix rings.
• Linear Recurrence Relations for Graph Polynomials
• On the eigenvalues of a matrix representing equivalence relation

This page was built for publication: Polynomial relations between matrices of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629997)