Spectral moments of regular graphs in terms of subgraph counts

DOI10.1016/j.laa.2013.12.028zbMath1292.05176OpenAlexW2045711310MaRDI QIDQ2442362

Marsha Kleinbauer, Ian M. Wanless

Publication date: 3 April 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.12.028

zbMATH Keywords

eigenvalueadjacency matrixregular graphspectral momenttotally reducible walktree-like walk

Mathematics Subject Classification ID

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

Related Items (1)

Spectral Radius of Graphs

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Walks and regular integral graphs
• On the number of matchings in regular graphs
• Spanning trees in regular graphs
• The expected eigenvalue distribution of a large regular graph
• Quartic integral Cayley graphs
• Counting Matchings and Tree-Like Walks in Regular Graphs
• Matchings and walks in graphs

This page was built for publication: Spectral moments of regular graphs in terms of subgraph counts