EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS

DOI10.1142/S0218348X18500421zbMath1433.34043MaRDI QIDQ4959958

Meifeng Dai, Jiahui Zou, Yu Sun, Wei Yi Su, Hualong Tang, Xiao Qian Wang

Publication date: 7 April 2020

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

eigenvaluenormalized Laplacian matrixeigentime identityweighted Koch network

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boundary value problems on graphs and networks for ordinary differential equations (34B45)

Related Items (9)

Mean first-passage times for two biased walks on the weighted rose networks ⋮ Eigentime identities of potting networks ⋮ Generalized adjacency and Laplacian spectra of the weighted corona graphs ⋮ SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS ⋮ Spectral analysis of weighted neighborhood networks ⋮ WEIERSTRASS-TYPE FUNCTIONS IN p-ADIC LOCAL FIELDS ⋮ FRACTALITY OF SUBSTITUTION NETWORKS ⋮ FRACTAL SETS IN THE FIELD OF p-ADIC ANALOGUE OF THE COMPLEX NUMBERS ⋮ On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks

Cites Work

• Unnamed Item
• Corrigendum to ``A numerical method of structure-preserving model updating problem and its perturbation theory [Appl. Math. Comput. 217 (13) (2011) 6364-6371]
• Spectra of graphs
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• Resistance distance and the normalized Laplacian spectrum
• Recursive weighted treelike networks
• Scale-free and small-world properties of Sierpinski networks
• Average weighted receiving time on the non-homogeneous double-weighted fractal networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Spanning trees and random walks on weighted graphs
• THE CONNECTION BETWEEN THE ORDERS OF p-ADIC CALCULUS AND THE DIMENSIONS OF THE WEIERSTRASS TYPE FUNCTION IN LOCAL FIELDS
• Kemeny's Constant and the Random Surfer
• Coherence analysis of a class of weighted networks
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Eigentime identities for on weighted polymer networks
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
• DIMENSION ANALYSIS OF CONTINUOUS FUNCTIONS WITH UNBOUNDED VARIATION
• Spectra of random graphs with given expected degrees

This page was built for publication: EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS