Eccentricity spectral radius of t-clique trees with given diameter

被引:3
|
作者
Qiu, Zhengping [1 ]
Tang, Zikai [2 ]
Li, Qiyue [2 ]
机构
[1] Hunan Inst Engn, Sch Computat Sci & Elect, Xiangtan 411104, Hunan, Peoples R China
[2] Hunan Normal Univ, Sch Math & Stat, MOE LCSM, Changsha 410081, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Clique tree; Tree; Eccentricity spectrum; Diameter; D-MAX; MATRIX; ENERGY;
D O I
10.1016/j.dam.2023.05.009
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The eccentricity matrix epsilon(G) of a graph G is obtained from the distance matrix D(G) by retaining only for each row and each column the largest distance, and setting the remaining elements as 0. In this paper, we firstly show that the eccentricity matrix of clique trees is irreducible. We identify the t-clique trees with given diameter odd d having the maximum epsilon-spectral radius, and the corresponding extremal graphs are also determined. We determine the upper bounds for the epsilon-spectral radius of t-clique trees which d and n satisfy that one is odd and the other is even. Finally, we propose some potential topics for further study. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页码:202 / 217
页数:16
相关论文
共 50 条
  • [41] Minimizing the Laplacian spectral radius of trees with given matching number
    Feng, Lihua
    Li, Qiao
    Zhang, Xiao-Dong
    LINEAR & MULTILINEAR ALGEBRA, 2007, 55 (02): : 199 - 207
  • [42] The Aα-spectral radius of trees and unicyclic graphs with given degree sequence
    Li, Dan
    Chen, Yuanyuan
    Meng, Jixiang
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 363
  • [43] On the spectral radius of weighted trees with fixed diameter and weight set
    Tan, Shang-wang
    Yao, Yan-hong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 431 (1-2) : 86 - 98
  • [44] The spectral radius of graphs without trees of diameter at most four
    Hou, Xinmin
    Liu, Boyuan
    Wang, Shicheng
    Gao, Jun
    Lv, Chenhui
    LINEAR & MULTILINEAR ALGEBRA, 2021, 69 (08): : 1407 - 1414
  • [45] Maximizing Laplacian spectral radius over trees with fixed diameter
    Lal, A. K.
    Patra, K. L.
    LINEAR & MULTILINEAR ALGEBRA, 2007, 55 (05): : 457 - 461
  • [46] Generalized eccentricity, radius, and diameter in graphs
    Dankelmann, P
    Goddard, W
    Henning, MA
    Swart, HC
    NETWORKS, 1999, 34 (04) : 312 - 319
  • [47] Spectral radius and clique partitions of graphs
    Zhou, Jiang
    van Dam, Edwin R.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 630 : 84 - 94
  • [48] On the Laplacian spectral radius of weighted trees with fixed diameter and weight set
    Tan, Shang-Wang
    Jiang, Jing-Jing
    LINEAR & MULTILINEAR ALGEBRA, 2011, 59 (02): : 173 - 192
  • [49] Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
    Wang, Jianfeng
    Huang, Qiongxiang
    LINEAR & MULTILINEAR ALGEBRA, 2011, 59 (07): : 733 - 744
  • [50] A Lower Bound for the Distance Laplacian Spectral Radius of Bipartite Graphs with Given Diameter
    Qi, Linming
    Miao, Lianying
    Zhao, Weiliang
    Liu, Lu
    MATHEMATICS, 2022, 10 (08)