Decreasing the spectral radius of a graph by link removals.

@article{Mieghem2011DecreasingTS,
  title={Decreasing the spectral radius of a graph by link removals.},
  author={Piet Van Mieghem and Dragan Stevanovic and Fernando Kuipers and Cong Li and Ruud van de Bovenkamp and Daijie Liu and Huijuan Wang},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2011},
  volume={84 1 Pt 2},
  pages={016101}
}
The decrease of the spectral radius, an important characterizer of network dynamics, by removing links is investigated. The minimization of the spectral radius by removing m links is shown to be an NP-complete problem, which suggests considering heuristic strategies. Several greedy strategies are compared, and several bounds on the decrease of the spectral radius are derived. The strategy that removes that link l=i~j with largest product (x(1))(i)(x(1))(j) of the components of the eigenvector x… CONTINUE READING
Highly Cited
This paper has 65 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 48 extracted citations

65 Citations

01020'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…