On the structure of Laplacian characteristic polynomial of circulant graphs

DOI10.1134/S1064562424701771zbMATH Open1540.05082MaRDI QIDQ6545162FDOQ6545162

Authors Young Soo Kwon, Alexander Mednykh, I. A. Mednykh 

Publication date 29 May 2024

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesLaplacian matrixcirculant graphrooted spanning tree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1823783
• The algebraic degree of spectra of circulant graphs
• On characteristic polynomials of periodic graphs
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• On circulants uniquely characterized by their independence polynomials.

Cites Work

• scientific article; zbMATH DE number 2230269 (Why is no real title available?)
• A certain polynomial of a graph and graphs with an extremal number of trees
• Asymptotics and arithmetical properties of complexity for circulant graphs
• Cauchy-Binet for pseudo-determinants
• Kirchhoff index for circulant graphs and its asymptotics
• Laplacian spectral characterization of dumbbell graphs and theta graphs
• Polynomials. Translated from the second Russian edition 2001 by Dimitry Leites.
• Spectral characterizations of propeller graphs
• The number of rooted forests in circulant graphs

This page was built for publication: On the structure of Laplacian characteristic polynomial of circulant graphs

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