Connectivity and Minimal Distance Spectral Radius of Graphs
Spectral Theory
2010-11-10 v1
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 cut vertices (respectively, cut edges) with the minimal distance spectral radius.
Cite
@article{arxiv.1011.2049,
title = {Connectivity and Minimal Distance Spectral Radius of Graphs},
author = {Xiaoling Zhang and Chris Godsil},
journal= {arXiv preprint arXiv:1011.2049},
year = {2010}
}
Comments
15 pages,1 figure