Spectral analysis for weighted iterated triangulations of graphs
From MaRDI portal
Publication:5219664
Recommendations
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Spectral analysis for weighted iterated \(q\)-triangulation networks
- Applications of Markov spectra for the weighted partition network by the substitution rule
- Spectral analysis for weighted tree-like fractals
- Spectral analysis of weighted neighborhood networks
Cites work
- A class of scale-free networks with fractal structure based on subshift of finite type
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Complex networks. Structure, robustness and function.
- Counting spanning trees in prism and anti-prism graphs
- Effect on normalized graph Laplacian spectrum by motif attachment and duplication
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- First-order network coherence and eigentime identity on the weighted Cayley networks
- Kemeny's Constant and the Random Surfer
- Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Parameterized model checking of weighted networks
- The role of Kemeny's constant in properties of Markov chains
Cited in
(31)- Scaling properties of first return time on weighted transfractals \((1, 3)\)-flowers
- Exact calculations of first-passage quantities on a class of weighted tree-like fractal networks
- Spectral analysis of weighted neighborhood networks
- Spectral analysis for weighted iterated \(q\)-triangulation networks
- Applications of Markov spectra for the weighted partition network by the substitution rule
- Mean first-passage times for two biased walks on the weighted rose networks
- Average trapping time of weighted scale-free \(m\)-triangulation networks
- Applications of Laplacian spectrum for the weighted scale-free network with a weight factor
- Spectral triples and wavelets for higher-rank graphs
- COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH
- EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
- Network coherence and eigentime identity on a family of weighted fractal networks
- Eigenvalue spectrum of transition matrix of dual Sierpiński gaskets and its applications
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- Eigenvalues of transition weight matrix for a family of weighted networks
- Spectral analysis for weighted tree-like fractals
- Spectral analysis for a family of treelike networks
- The average trapping time on the weighted pseudofractal scale-free web
- The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
- Fractality of substitution networks
- The normalized Laplacian spectrum of pentagonal graphs and its applications
- Spectral dynamics of graph sequences generated by subdivision and triangle extension
- Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- Convergence of the diffusion method for weighted torus graphs using Fourier analysis
- The normalized Laplacian spectrum of subdivisions of a graph
- Spectrum Consistent Coarsening Approximates Edge Weights
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Coherence analysis of a class of weighted networks
- On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
This page was built for publication: Spectral analysis for weighted iterated triangulations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219664)
