Spectra of graphs. Theory and application
From MaRDI portal
Publication:6554591
Cited in
(11)- Graphs with the minimum spectral radius for given independence number
- On normalized signless Laplacian resolvent energy
- When (signless) Laplacian coefficients meet matchings of subdivision
- On the minimum spectral radius of graphs with given order and dissociation number
- On the \(A_\alpha\)-spectra of some corona graphs
- Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs
- Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
- Quantum local random networks and the statistical robustness of quantum scars
- Universal adjacency spectrum of the commuting and non-commuting graphs on AC-groups
- The matching polynomial of the path-tree of a complete graph
- The differential on graph operator \(\mathrm{R}(G)\)
This page was built for publication: Spectra of graphs. Theory and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554591)