CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS
From MaRDI portal
Publication:5108063
DOI10.1142/S0218348X19500749zbMath1434.05092OpenAlexW2938681442WikidataQ128119705 ScholiaQ128119705MaRDI QIDQ5108063
Meifeng Dai, Yu Sun, Yongbo Hou, Changxi Dai, Tingting Ju, Wei Yi Su
Publication date: 29 April 2020
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x19500749
Trees (05C05) Graph polynomials (05C31) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (4)
Spectral analysis of weighted neighborhood networks ⋮ CONSENSUS ANALYSIS IN HIERARCHICAL NETWORKED SYSTEMS ⋮ LEADER–FOLLOWER COHERENCE OF THE WEIGHTED RECURSIVE TREE NETWORKS ⋮ NODE-WEIGHTED AVERAGE DISTANCES OF NETWORKS MODELED ON THREE-DIMENSIONAL VICSEK FRACTAL
Cites Work
- Statistical physics of vaccination
- Promoting cooperation in social dilemmas via simple coevolutionary rules
- Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
- Scale-free and small-world properties of Sierpinski networks
- Network coherence in the web graphs
- Measures and dimensions of fractal sets in local fields
- Random walks on non-homogenous weighted Koch networks
- Regularity of a fractional partial differential equation driven by space-time white noise
- Coherence analysis of a class of weighted networks
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- Convergence speed of a fractional order consensus algorithm over undirected scale‐free networks
- MULTIFRACTAL ANALYSIS OF ONE-DIMENSIONAL BIASED WALKS
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- Delay Robustness of a Class of Nonlinear Systems and Applications to Communication Networks
This page was built for publication: CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS
