摘要

A quasi-tree is a graph for which the deletion of some vertex results in a tree. We determine the unique graph with minimum distance spectral radius among quasi-trees with fixed order and the unique graph with maximum distance spectral radius among cycle containing quasi-trees with fixed order.