Eigentime identities for on weighted polymer networks
From MaRDI portal
Publication:5212129
DOI10.1142/S0217979218500212zbMATH Open1429.05122MaRDI QIDQ5212129FDOQ5212129
Authors: Meifeng Dai, Hualong Tang, Jiahui Zou, Di He, Yu Sun, Su Weiyi 
Publication date: 27 January 2020
Published in: International Journal of Modern Physics B (Search for Journal in Brave)
Recommendations
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- Eigentime identity of the weighted \((m,n)\)-flower networks
Cites Work
- Spanning trees and random walks on weighted graphs
- Resistance distance and the normalized Laplacian spectrum
- Counting spanning trees in prism and anti-prism graphs
- Global synchronization of weighted cellular neural network with time-varying coupling delays
- Random walks on graphs: ideas, techniques and results
- Title not available (Why is that?)
Cited In (9)
- Applications of Markov spectra for the weighted partition network by the substitution rule
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- Eigentime identities of potting networks
- Eigentime identity of the weighted \((m,n)\)-flower networks
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- Eigentime identities of fractal sailboat networks
- EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS
This page was built for publication: Eigentime identities for on weighted polymer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212129)
