Degree distribution and assortativity in line graphs of complex networks
From MaRDI portal
Publication:1619123
DOI10.1016/J.PHYSA.2015.10.109zbMATH Open1400.05205OpenAlexW2244127964MaRDI QIDQ1619123FDOQ1619123
Authors: Stojan Trajanovski, Robert E. Kooij, Piet Van Mieghem, Xiangrong 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
Recommendations
- Assortativity in complex networks
- Degree distribution of a scale-free random graph model
- scientific article; zbMATH DE number 3847442
- Degree correlations in scale-free random graph models
- Two-walks degree assortativity in graphs and networks
- Assortativity measures for weighted and directed networks
- Asymptotic distribution of modularity in networks
- Higher order assortativity in complex networks
- Degree distributions of generalized hooking networks
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- ILIGRA: an efficient inverse line graph algorithm
- Assortativity in complex networks
- Which graphs are determined by their spectrum?
- Title not available (Why is that?)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Title not available (Why is that?)
- Title not available (Why is that?)
- The minimal spectral radius of graphs with a given diameter
- The interchange graph of a finite graph
- Graph spectra for complex networks
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Performance Analysis of Complex Networks and Systems
Cited In (7)
- Parameter specification for the degree distribution of simulated Barabási-Albert graphs
- Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient
- High-order degree and combined degree in complex networks
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- A study on the relationship between connecting different types of nodes and disassortativity by degree
- Clustering in random line graphs
- Assortativity in complex networks
Uses Software
This page was built for publication: Degree distribution and assortativity in line graphs of complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619123)
