Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
From MaRDI portal
Publication:5063462
DOI10.1080/00207160.2021.1919303zbMath1499.05408OpenAlexW3154216708MaRDI QIDQ5063462
Publication date: 21 March 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2021.1919303
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective resistances and Kirchhoff index of ladder graphs
- On a conjecture concerning spanning tree invariants and loop systems
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Enumerating spanning trees of graphs with an involution
- The electrical resistance of a graph captures its commute and cover times
- The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
- Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
- Cacti with maximal general sum-connectivity index
- Kirchhoff index of periodic linear chains
- Explicit determination of three invariants associated with random walks on n-prism networks
- On the normalized Laplacians with some classical parameters involving graph transformations
- Consensus and Coherence in Fractal Networks
This page was built for publication: Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons