SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
From MaRDI portal
Publication:6114687
DOI10.1142/s0218348x23500494zbMath1519.05110OpenAlexW4363679434MaRDI QIDQ6114687
Publication date: 15 August 2023
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x23500494
weighted graphfractalspanning treesKemeny's constantnormalized Laplacian spectrumweighted level-4 Sierpiński graph
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Fractals (28A80) Signed and weighted graphs (05C22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Resistance distance and the normalized Laplacian spectrum
- Spanning trees on the Sierpinski gasket
- Geometry of minimum spanning trees on scale-free networks
- Network coherence and eigentime identity on a family of weighted fractal networks
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
- Spectral properties of hypercubes with applications
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- Spectral analysis for weighted tree-like fractals
- Spanning trees and random walks on weighted graphs
- Counting spanning trees on fractal graphs and their asymptotic complexity
- Algebraic aspects of the normalized Laplacian
- Theory of resistor networks: the two-point resistance
- Eigenvalue spectrum of transition matrix of dual Sierpinski gaskets and its applications
- Spectral densities of scale-free networks
- Kemeny's Constant and the Random Surfer
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY 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
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- Applications of Markov spectra for the weighted partition network by the substitution rule
- Spectral analysis for weighted iterated q-triangulation networks
- Network synchronizability analysis: A graph-theoretic approach
- Vibration modes of 3n-gaskets and other fractals
- Spectra of random graphs with given expected degrees
- Asymptotic Enumeration of Spanning Trees
- SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
