Zhongzhu, Liu On spectral radius of the distance matrix. (English) Zbl 1265.05434 Appl. Anal. Discrete Math. 4, No. 2, 269-277 (2010). Summary: We characterize graphs with minimal spectral radius of the distance matrix in three classes of simple connected graphs with \(n\) vertices: with fixed vertex connectivity, matching number and chromatic number, respectively. Cited in 25 Documents MSC: 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) 05C75 Structural characterization of families of graphs Keywords:vertex connectivity; matching number; chromatic number; minimal spectral radius; distance matric PDFBibTeX XMLCite \textit{L. Zhongzhu}, Appl. Anal. Discrete Math. 4, No. 2, 269--277 (2010; Zbl 1265.05434) Full Text: DOI