Polynomial relations between matrices of graphs. Issue 3 (24th September 2018)

• Record Type: Journal Article
• Authors: Spiro, Sam
• Is Part Of: Journal of graph theory. Volume 90:Issue 3(2019)
• Page Start: 288
• Page End: 303
• Publication Date: 2018-09-24
• Subjects: biregular graphs -- combinatorics -- Spectral Graph Theory; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.22401
• Languages: English
• ISSNs: 0364-9024

Abstract

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.