On the structure of Laplacian characteristic polynomial of circulant graphs
From MaRDI portal
Publication:6545162
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)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph polynomials (05C31)
Cites Work
- Polynomials. Translated from the second Russian edition 2001 by Dimitry Leites.
- A certain polynomial of a graph and graphs with an extremal number of trees
- Cauchy-Binet for pseudo-determinants
- Title not available (Why is that?)
- Laplacian spectral characterization of dumbbell graphs and theta graphs
- Asymptotics and arithmetical properties of complexity for circulant graphs
- Spectral characterizations of propeller graphs
- The number of rooted forests in circulant graphs
- Kirchhoff index for circulant graphs and its asymptotics
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)
