Laplacian spectra for categorical product networks and its applications
From MaRDI portal
Publication:2333608
DOI10.3390/sym10060206zbMath1423.05101OpenAlexW2805678214MaRDI QIDQ2333608
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10060206
Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Estimation of Laplacian spectra of direct and strong product graphs
- Entropy and the complexity of graphs revisited
- Resistance distances and the Kirchhoff index in Cayley graphs
- Spectra of graphs
- The electrical resistance of a graph captures its commute and cover times
- Complex networks: structure and dynamics
- The number of spanning trees in Apollonian networks
- A note on ‘some physical and chemical indices of clique-inserted lattices’
- Laplacian spectrum of a family of recursive trees and its applications in network coherence
- Matrix Analysis
- Unnamed Item
- Unnamed Item
This page was built for publication: Laplacian spectra for categorical product networks and its applications