EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
From MaRDI portal
(Redirected from EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS)
Recommendations
- Eigentime identities of potting networks
- Eigentime identities for on weighted polymer networks
- Eigentime identity of the weighted \((m,n)\)-flower networks
- First-order network coherence and eigentime identity on the weighted Cayley networks
- Network coherence and eigentime identity on a family of weighted fractal networks
- Properties and applications of Laplacian spectra for Koch networks
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- Eigenvalues with respect to a weight for general boundary value problems on networks
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- Eigentime identities of fractal sailboat networks
Cites work
- Average weighted receiving time on the non-homogeneous double-weighted fractal networks
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Coherence analysis of a class of weighted networks
- Corrigendum to ``A numerical method of structure-preserving model updating problem and its perturbation theory [Appl. Math. Comput. 217 (13) (2011) 6364-6371]
- Counting spanning trees in prism and anti-prism graphs
- Dimension analysis of continuous functions with unbounded variation
- Eigentime identities for on weighted polymer networks
- First-order network coherence and eigentime identity on the weighted Cayley networks
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Kemeny's Constant and the Random Surfer
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Recursive weighted treelike networks
- Resistance distance and the normalized Laplacian spectrum
- Scale-free and small-world properties of Sierpinski networks
- Spanning trees and random walks on weighted graphs
- Spectra of graphs
- Spectra of random graphs with given expected degrees
- Spectral analysis for weighted iterated triangulations of graphs
- THE CONNECTION BETWEEN THE ORDERS OF p-ADIC CALCULUS AND THE DIMENSIONS OF THE WEIERSTRASS TYPE FUNCTION IN LOCAL FIELDS
Cited in
(17)- Multifractal analysis and topological properties of a new family of weighted Koch networks
- On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- Eigentime identities of fractal sailboat networks
- 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
- First-order network coherence and eigentime identity on the weighted Cayley networks
- EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS
- Fractality of substitution networks
- FRACTAL SETS IN THE FIELD OF p-ADIC ANALOGUE OF THE COMPLEX NUMBERS
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- Weierstrass-type functions in p-adic local fields
- Eigentime identity of the weighted \((m,n)\)-flower networks
- Eigentime identities for on weighted polymer networks
- SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
- Spectral analysis of weighted neighborhood networks
This page was built for publication: EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959958)
