Title of article
THE MINIMUM ε-SPECTRAL RADIUS OF t-CLIQUE TREES WITH GIVEN DIAMETER
Author/Authors
Qiu ، Zhengping School of Computational Science and Electronics - Hunan Institute of Engineering , Deng ، Hanyuan College of Mathematics and Computer Science - Hunan Normal University , Tang ، Zikai School of Mathematics and Statistics - Hunan Normal University
From page
235
To page
255
Abstract
The eccentricity matrix ε(G) of a graph G is defined as ε(G)uv duv duv = min{e(u), e(v)}, 0 duv min{e(u), e(v)}. 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 ε-spectral radius.Simultaneously, we calculate the lower bound of ε-spectral radius of t-clique trees when n − d is odd.
Keywords
Clique tree , diameter , minimal value , eccentricity matrix , ε , spectra.
Journal title
Transactions on Combinatorics
Journal title
Transactions on Combinatorics
Record number
2772546
Link To Document