Title
An energy-based heterogeneity measure for quantifying structural irregularity in complex networks.
Abstract
•We propose a novel yet efficient normalized measure for quantifying the structural heterogeneity characteristics of graphs.•The proposed measure is based on the difference between energy and Laplacian energy.•The simulation results imply that the proposed measure has lower bound 0 and upper bound 1, for regular graphs and star-like graphs, respectively.•The proposed measure can identify the structural topological differences of synthetic and real-world complex networks.
Year
DOI
Venue
2019
10.1016/j.jocs.2019.06.008
Journal of Computational Science
Keywords
Field
DocType
Complex networks,Graph energy,Graph laplacian energy,And graph irregularity measures
Graph,Spectral graph theory,Computer science,Upper and lower bounds,Algorithm,Theoretical computer science,Complex network,Laplace operator
Journal
Volume
ISSN
Citations 
36
1877-7503
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Farshad Safaei19519.37
sepehr tabrizchi263.34
Amir H. Hadian-Rasanan300.34
M. Zare400.34