SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS

DOI10.1142/S0218348X18500172zbMath1432.35058OpenAlexW2784042218MaRDI QIDQ5219664

Meifeng Dai, Yufei Chen, Wei Yi Su, Yu Sun, Xiao Qian Wang

Publication date: 12 March 2020

Published in: Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218348x18500172

zbMATH Keywords

weighted graphKirchhoff indexKemeny's constantnormalized Laplacian spectrumweighted spanning trees

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05)

Related Items (20)

Network coherence and eigentime identity on a family of weighted fractal networks ⋮ Spectral analysis for a family of treelike networks ⋮ Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk ⋮ The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network ⋮ Mean first-passage times for two biased walks on the weighted rose networks ⋮ Generalized adjacency and Laplacian spectra of the weighted corona graphs ⋮ Coherence analysis of a class of weighted networks ⋮ SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS ⋮ Spectral analysis of weighted neighborhood networks ⋮ EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ EXACT CALCULATIONS OF FIRST-PASSAGE QUANTITIES ON A CLASS OF WEIGHTED TREE-LIKE FRACTAL NETWORKS ⋮ COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH ⋮ The average trapping time on the weighted pseudofractal scale-free web ⋮ Applications of Markov spectra for the weighted partition network by the substitution rule ⋮ Average trapping time of weighted scale-free m-triangulation networks ⋮ EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS ⋮ FRACTALITY OF SUBSTITUTION NETWORKS ⋮ Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs ⋮ On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks ⋮ Eigenvalues of transition weight matrix for a family of weighted networks

Cites Work

• Unnamed Item
• On the spectrum of the normalized Laplacian of iterated triangulations of 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
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Parameterized model checking of weighted networks
• Multifractality and Laplace spectrum of horizontal visibility graphs constructed from fractional Brownian motions
• Kemeny's Constant and the Random Surfer
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• A class of scale-free networks with fractal structure based on subshift of finite type
• The Role of Kemeny's Constant in Properties of Markov Chains

This page was built for publication: SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS