en عمومى General پژوهشي Research paper <div style="text-align: justify;">Let G be a simple connected graph. The terminal distance matrix of G is the distance matrix between all pendant vertices of G. In this paper, we study the terminal distance matrix and compute the characteristic polynomial of this matrix for some rooted trees. Also we obtain lower bounds for the spectral radius of the terminal distance matrix of graphs and characterize those graphs for which the bounds are best possible.<br> &nbsp;</div> Terminal distance matrix, Terminal distance spectral radius, Terminal Wiener index. 231 241 http://ijmsi.ir/browse.php?a_code=A-10-5998-1&slc_lang=en&sid=1 Abbas Heydari Heydari@arakut.ac.ir 100319475328460011315 100319475328460011315 Yes Department of Science, Arak University of Technology, Arak, Iran