Connectivity and Minimal Distance Spectral Radius of Graphs
classification
🧮 math.SP
keywords
distanceradiusspectraledgesgraphminimalapplicationsbehaves
read the original abstract
In this paper, we study how the distance spectral radius behaves when the graph is perturbed by grafting edges. As applications, we also determine the graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal distance spectral radius.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.