Degree distribution and assortativity in line graphs of complex networks

DOI10.1016/j.physa.2015.10.109zbMath1400.05205OpenAlexW2244127964MaRDI QIDQ1619123

Robert E. Kooij, Piet Van Mieghem, Stojan Trajanovski, Xiang-Rong Wang

Publication date: 13 November 2018

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

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

zbMATH Keywords

line graphdegree distributioncomplex networkassortativity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Parameter specification for the degree distribution of simulated Barabási-Albert graphs ⋮ EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ High-order degree and combined degree in complex networks

Uses Software

• ILIGRA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Influence of assortativity and degree-preserving rewiring on the spectra of networks
• The minimal spectral radius of graphs with a given diameter
• ILIGRA: an efficient inverse line graph algorithm
• Which graphs are determined by their spectrum?
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Assortativity in complex networks
• Performance Analysis of Complex Networks and Systems
• The interchange graph of a finite graph