Research article

Extremal unicyclic graphs for the eccentricity spectral radius

  • Published: 13 November 2026
  • MSC : 05C50, 15A18

  • Let $ U_{n, d} $ denote the set of $ n $-vertex unicyclic graphs with at least one pendant vertex and odd diameter $ d\ge 3 $. In this paper, we first prove the irreducibility of the eccentricity matrix $ \varepsilon(G) $ of the unicyclic graph $ G\in U_{n, d} $ when $ \mid V(P_{d+1})\cap V(C_r)\mid \le 2 $, and we determine the maximum $ \varepsilon $-spectral radius $ \varepsilon_1(G) $ of all unicyclic graphs with $ d = 3 $. Furthermore, we identify the extremal graphs of the following two types unicyclic graphs $ G \in U_{n, d} $ with fixed odd $ d \ge 5 $, having the maximum eccentricity spectral radius: $ \mid V(P_{d+1})\cap V(C_r)\mid \le 1 $ or $ \mid V(P_{d+1})\cap V(C_r)\mid = 2\; \text{with even}\; r\ge 4 $, where $ P_{d+1} $ is one of diametral paths of $ G $, $ C_r $ is the unique cycle of $ G $, $ V(P_{d+1}) $ and $ V(C_r) $ represent, respectively, the vertex sets of $ P_{d+1} $ and $ C_r $.

    Citation: Zhengping Qiu, Zikai Tang, Shilin Zeng. Extremal unicyclic graphs for the eccentricity spectral radius[J]. AIMS Mathematics, 2026, 11(11): 37627-37653. doi: 10.3934/math.20261456

    Related Papers:

  • Let $ U_{n, d} $ denote the set of $ n $-vertex unicyclic graphs with at least one pendant vertex and odd diameter $ d\ge 3 $. In this paper, we first prove the irreducibility of the eccentricity matrix $ \varepsilon(G) $ of the unicyclic graph $ G\in U_{n, d} $ when $ \mid V(P_{d+1})\cap V(C_r)\mid \le 2 $, and we determine the maximum $ \varepsilon $-spectral radius $ \varepsilon_1(G) $ of all unicyclic graphs with $ d = 3 $. Furthermore, we identify the extremal graphs of the following two types unicyclic graphs $ G \in U_{n, d} $ with fixed odd $ d \ge 5 $, having the maximum eccentricity spectral radius: $ \mid V(P_{d+1})\cap V(C_r)\mid \le 1 $ or $ \mid V(P_{d+1})\cap V(C_r)\mid = 2\; \text{with even}\; r\ge 4 $, where $ P_{d+1} $ is one of diametral paths of $ G $, $ C_r $ is the unique cycle of $ G $, $ V(P_{d+1}) $ and $ V(C_r) $ represent, respectively, the vertex sets of $ P_{d+1} $ and $ C_r $.



    加载中


    [1]

    M. Randić, $D_{\mathrm{MAX}}$-matrix of dominant distances in a graph, MATCH-Commun. Math. Co., 70 (2013), 221–238.

    [2]

    M. Randić, R. Orel, A. Balaban, $D_{\mathrm{MAX}}$ matrix invariants as graph descriptors. Graphs having the same Balaban index J, MATCH-Commun. Math. Co., 70 (2013), 239–258.

    [3]

    J. F. Wang, M. Lu, F. Belardo, M. Randić, The anti-adjacency matrix of a graph: Eccentricity matrix, Discrete Appl. Math., 251 (2018), 299–309. https://doi.org/10.1016/j.dam.2018.05.062

    doi: 10.1016/j.dam.2018.05.062
    [4]

    J. F. Wang, M. Lu, L. Lu, F. Belardo, Spectral properties of the eccentricity matrix of graphs, Discrete Appl. Math., 279 (2020), 168–177. https://doi.org/10.1016/j.dam.2019.10.015

    doi: 10.1016/j.dam.2019.10.015
    [5]

    Z. P. Qiu, Z. K. Tang, On the eccentricity spectra of threshold graphs, Discrete Appl. Math., 310 (2022), 75–85. https://doi.org/10.1016/j.dam.2021.12.024

    doi: 10.1016/j.dam.2021.12.024
    [6]

    I. Mahato, R. Gurusamy, M. Kannan, S. Arockiaraj, Spectra of eccentricity matrices of graphs, Discrete Appl. Math., 285 (2020), 252–260. https://doi.org/10.1016/j.dam.2020.05.029

    doi: 10.1016/j.dam.2020.05.029
    [7]

    B. A. Rather, X. Gao, J. F. Wang, Spectral spread and trace norm of eccentricity matrix of graphs. Discrete Appl. Math., 352 (2024), 9–19. https://doi.org/10.1016/j.dam.2024.03.020

    [8]

    W. Wei, S. C. Li, On the eccentricity spectra of complete multipartite graphs, Appl. Math. Comput., 424 (2022), 127036. https://doi.org/10.1016/j.amc.2022.127036

    doi: 10.1016/j.amc.2022.127036
    [9]

    S. Pandey, L. Selvaganesh, J. Pervin, Eccentricity matrix of corona of two graphs. Discrete Appl. Math., 359 (2024), 354–363. https://doi.org/10.1016/j.dam.2024.08.017

    [10]

    J. F. Wang, L. Lu, M. Randić, G. Z. Li, Graph energy based on the eccentricity matrix, Discrete Math., 342 (2019), 2636–2646. https://doi.org/10.1016/j.disc.2019.05.033

    doi: 10.1016/j.disc.2019.05.033
    [11]

    T. Divyadevi, I. Jeyaraman, On the eccentricity matrices of certain bi-block graphs, Bull. Malays. Math. Sci. Soc., 47 (2024), 92. https://doi.org/10.1007/s40840-024-01687-3

    doi: 10.1007/s40840-024-01687-3
    [12]

    J. F. Wang, X. Y. Lei, W. Wei, X. B. Luo, S. C. Li, On the eccentricity matrix of graphs and its applications to the boiling point of hydrocarbons, Chemometr. Intell. Lab., 207 (2020), 104173. https://doi.org/10.1016/j.chemolab.2020.104173

    doi: 10.1016/j.chemolab.2020.104173
    [13]

    M. Asif, M. Atif, N. Akhtar, M. F. Hanif, M. K. Siddiqui, On Analysis of cubic zirconia network through eccentricity operators, Chem. Pap., 79 (2025), 2925–2935. https://doi.org/10.1007/s11696-025-03978-w

    doi: 10.1007/s11696-025-03978-w
    [14]

    Z. P. Qiu, Z. K. Tang, Q. Y. Li, Eccentricity spectral radius of clique trees with given diameter, Discrete Appl. Math., 337 (2023), 202–217. https://doi.org/10.1016/j.dam.2023.05.009

    doi: 10.1016/j.dam.2023.05.009
    [15]

    Z. P. Qiu, H. Y. Deng, Z. K. Tang, The minimum $\varepsilon$-spectral radius of $t$-clique trees with given diameter, Trans. Comb., 13 (2024), 235–255. https://doi.org/10.22108/toc.2023.134435.2002

    doi: 10.22108/toc.2023.134435.2002
    [16]

    W. Wei, X. C. He, S. C. Li, Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond, Discrete Math., 343 (2020), 111925. https://doi.org/10.1016/j.disc.2020.111925

    doi: 10.1016/j.disc.2020.111925
    [17]

    W. Lin, N. Chen, J. Liu, On the maximum ABC spectral radius of connected graphs with given maximum degree, Appl. Anal. Discrete Math., 20 (2026), 273–282. https://doi.org/10.2298/AAD-M231107012L

    doi: 10.2298/AAD-M231107012L
    [18]

    X. Y. Lei, J. F. Wang, G. Z. Li, On the eigenvalues of eccentricity matrix of graphs, Discrete Appl. Math., 295 (2021), 134–147. https://doi.org/10.1016/j.dam.2021.02.029

    doi: 10.1016/j.dam.2021.02.029
    [19]

    W. Wei, S. C. Li, L. C. Zhang, Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond, Discrete Math., 345 (2022), 112686. https://doi.org/10.1016/j.disc.2021.112686

    doi: 10.1016/j.disc.2021.112686
    [20]

    J. F. Wang, M. Lu, M. Brunetti, L. Lu, X. Y. Huang, Spectral determinations and eccentricity matrix of graphs, Adv. Appl. Math., 139 (2022), 102358. https://doi.org/10.1016/j.aam.2022.102358

    doi: 10.1016/j.aam.2022.102358
    [21]

    J. B. Liu, X. J. Tang, G. J. Cai, J. D. Cao, Spectrum and Coherence Analysis in Networks with Noise Disturbance, J. Complex Netw., 14 (2026), cnaf046. https://doi.org/10.1093/comnet/cnaf046

    doi: 10.1093/comnet/cnaf046
    [22]

    H. Minc, Nonnegative matrices, New York: Wiley, 1988.

    [23]

    R. Horn, C. Johnson, Matrix analysis, 2 Eds., Cambridge: Cambridge University Press, 2013.

    [24]

    X. C. He, L. Lu, On the largest and least eigenvalues of eccentricity matrix of trees, Discrete Math., 345 (2022), 112662. https://doi.org/10.1016/j.disc.2021.112662

    doi: 10.1016/j.disc.2021.112662
  • Reader Comments
  • © 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

Metrics

Article views(71) PDF downloads(6) Cited by(0)

Article outline

Figures and Tables

Figures(12)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog