THE MINIMUM ε-SPECTRAL RADIUS OF t-CLIQUE TREES WITH GIVEN DIAMETER.

The eccentricity matrix ε(G) of a graph G is defined as...Let Tt be a t-clique tree corresponding to the tree T(underlying graph of Tt) with order n' = (n-1)t+1 and diameter d. In this paper, we identify the extremal t-clique trees with given diameter having the minimum e-spectral radius. Simultaneously, we calculate the lower bound of e-spectral radius of t-clique trees when n - d is odd. [ABSTRACT FROM AUTHOR]