Influence of assortativity and degree-preserving rewiring on the spectra of networks
From MaRDI portal
Publication:614567
DOI10.1140/epjb/e2010-00219-xzbMath1202.05131MaRDI QIDQ614567
Publication date: 4 January 2011
Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:19e89859-7c67-4f52-931a-30fba16953b1
adjacency matrix; largest eigenvalue; algebraic connectivity; assortativity; disassortativity; rewiring algorithm
05C80: Random graphs (graph-theoretic aspects)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Number of walks and degree powers in a graph
- Another look at the degree constrained subgraph problem
- A degree sequence problem related to network design
- Sparsification—a technique for speeding up dynamic graph algorithms
- Graph Spectra for Complex Networks
- Performance Analysis of Communications Networks and Systems