A new method optimizing the subgraph centrality of large networks

DOI10.1016/J.PHYSA.2015.10.034zbMath1400.90293OpenAlexW1757839851MaRDI QIDQ1619035

Xin Yan, Chunlin Li, Yaogai Hu, Ling Zhang

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.034

zbMATH Keywords

optimizationspectral radiusspectral densitystructural propertiesnetwork connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

Network structure optimization for social networks by minimizing the average path length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with given diameter maximizing the algebraic connectivity
• Characteristic vectors of bordered matrices with infinite dimensions
• On the distribution of the roots of certain symmetric matrices
• Old and new results on algebraic connectivity of graphs
• The eigenvalues of random symmetric matrices
• Eigenvector perturbations of complex networks
• Metric structure of random networks
• Robustness of random graphs based on graph spectra
• Eigenvalue spectra of complex networks

This page was built for publication: A new method optimizing the subgraph centrality of large networks