|
|
|
|
the minimum ε-spectral radius of t-clique trees with given diameter
|
|
|
|
|
|
|
|
نویسنده
|
qiu zhengping ,deng hanyuan ,tang zikai
|
|
منبع
|
transactions on combinatorics - 2024 - دوره : 13 - شماره : 3 - صفحه:235 -255
|
|
چکیده
|
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.
|
|
کلیدواژه
|
clique tree ,diameter ,minimal value ,eccentricity matrix ,ε-spectra.
|
|
آدرس
|
hunan institute of engineering, school of computational science and electronics, china, hunan normal university, college of mathematics and computer science, china, hunan normal university, school of mathematics and statistics, china
|
|
پست الکترونیکی
|
zikaitang@163.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|