Generalized adjacency and Laplacian spectra of the weighted corona graphs

DOI10.1016/j.physa.2019.121285OpenAlexW2944519189WikidataQ127898128 ScholiaQ127898128MaRDI QIDQ2161928

Lingfei Dai, Yongbo Hou, Tingting Ju, Junjie Shen, Meifeng Dai, Wei Yi Su

Publication date: 5 August 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2019.121285

zbMATH Keywords

Laplacian spectrumgeneralized adjacency matrixweighted corona graph

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (4)

AVERAGE FERMAT DISTANCES OF TWO-COLORED SUBSTITUTION NETWORKS ⋮ Spectral analysis of weighted neighborhood 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

Cites Work

• Unnamed Item
• The distance spectrum of corona and cluster of two graphs
• On the Laplacian spectra of some variants of corona
• The expected eigenvalue distribution of a large regular graph
• On recognizing graph properties from adjacency matrices
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• The modified box dimension and average weighted receiving time of the weighted hierarchical graph
• The relations between network-operation and topological-property in a scale-free and small-world network with community structure
• Scale-free effect of substitution networks
• Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
• Fractality of evolving self-similar networks
• Network coherence in the web graphs
• Bootstrap percolation on the random regular graph
• On Computing the Critical Coupling Coefficient for the Kuramoto Model on a Complete Bipartite Graph
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• The stretch to stray on time: Resonant length of random walks in a transient
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
• The cover time of a biased random walk on a random cubic graph
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
• DIMENSION ANALYSIS OF CONTINUOUS FUNCTIONS WITH UNBOUNDED VARIATION
• The Spectrum of the Corona of Two Graphs
• Analysis of Relaxation Time in Random Walk with Jumps

This page was built for publication: Generalized adjacency and Laplacian spectra of the weighted corona graphs