Applications of Markov spectra for the weighted partition network by the substitution rule
From MaRDI portal
Publication:5143429
DOI10.1088/1572-9494/ab7ed3zbMath1451.05216OpenAlexW3018398687MaRDI QIDQ5143429
Tingting Ju, Meifeng Dai, Wei Yi Su, Fang Huang, Yongbo Hou, Dong-Lei Tang
Publication date: 12 January 2021
Published in: Communications in Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1572-9494/ab7ed3
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Lower bounds for the minimum eigenvalue of Hadamard product of an \(M\)-matrix and its inverse
- Resistance distance and the normalized Laplacian spectrum
- Self-similarity analysis of eubacteria genome based on weighted graph
- Spectral analysis for a family of treelike networks
- Self-Similarity of Graphs
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- Coherence analysis of a class of weighted networks
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- The Firm as a Communication Network
- MARKOV SPECTRA OF SELF-SIMILAR NETWORKS BY SUBSTITUTION RULE
- Eigentime identities for on weighted polymer networks
- SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
- Applications of Laplacian spectrum for the weighted scale-free network with a weight factor
- Maximum and Minimum First Eigenvalues for a Class of Elliptic Operators
This page was built for publication: Applications of Markov spectra for the weighted partition network by the substitution rule