Connectivity and Minimal Distance Spectral Radius of Graphs
Zhang, Xiaoling · Godsil, Chris
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.