Bounds on the spectral radius of graphs via subgraph deletion and coalescence
The spectral radius of a graph is a fundamental parameter closelylinked to network dynamics and robustness. Understanding its precisevariation under structural perturbations such as vertex deletion,edge removal, or graph coalescence is a central problem in spectralgraph theory. In this paper, we establish several sharp...