Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks
From MaRDI portal
Publication:2161711
DOI10.1016/J.PHYSA.2019.121130OpenAlexW2943571863MaRDI QIDQ2161711
Zhulou Cao, Yue Ma, Xingqin Qi
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.121130
time complexityKendall's coefficientquasi-Laplacian energyquasi-Laplacian matrixvertex centrality method
Related Items (2)
Quasi-Laplacian energy of composite graphs ⋮ Identification of node centrality based on Laplacian energy of networks
Uses Software
Cites Work
- Unnamed Item
- A history of graph entropy measures
- Laplacian centrality: A new centrality measure for weighted networks
- Identifying influential spreaders in complex networks based on gravity formula
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- A faster algorithm for betweenness centrality*
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- A characterization of the smallest eigenvalue of a graph
- Collective dynamics of ‘small-world’ networks
- A NEW MEASURE OF RANK CORRELATION
This page was built for publication: Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks