Abstract
The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the unique hypertrees that minimize the distance spectral radius among all uniform hypertrees with fixed size and one of the parameters, such as number of pendant edges, diameter, and maximum degree that is more than half of the size.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
No datasets were generated or analysed during the current study.
References
Aouchiche M, Hansen P (2014) Distance spectra of graphs: a survey. Linear Algebra Appl 458:301–386. https://doi.org/10.1016/j.laa.2014.06.010
Balaban AT, Ciubotariu D, Medeleanu M (1991) Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors. J Chem Inf Comput Sci 31:517–523. https://doi.org/10.1021/ci00004a014
Cooper J, Dutle A (2012) Spectra of uniform hypergraphs. Linear Algebra Appl 436:3268–3292. https://doi.org/10.1016/j.laa.2011.11.018
Du Z, Ilić A, Feng L (2013) Further results on the distance spectral radius of graphs. Linear Multilinear Algebra 61:1287–1301. https://doi.org/10.1080/03081087.2012.750654
Graham RL, Pollak HO (1971) On the addressing problem for loop switching. Bell System Tech J 50:2495–2519
Gutman I, Medeleanu M (1998) On the structure-dependence of the largest eigenvalue of the distance matrix of an alkane. Indian J Chem A 37:569–573
Lin H, Zhou B (2016) Distance spectral radius of uniform hypergraphs. Linear Algebra Appl 506:564–578. https://doi.org/10.1016/j.laa.2016.06.011
Lin H, Zhou B (2018) On distance spectral radius of uniform hypergraphs with cycles. Discrete Appl Math 239:125–143. https://doi.org/10.1016/j.dam.2017.12.011
Lin H, Zhou B, Li Y (2018) On distance spectral radius of uniform hypergraphs. Linear Multilinear Algebra 66:497–513. https://doi.org/10.1080/03081087.2017.1301366
Lin H, Shu J, Xue J, Zhang Y (2021) A survey on distance spectra of graphs. Adv Math (China) 50:29–76
Liu X, Wang L, Li X (2021) Distance spectral radii of \(k\)-uniform hypertrees with given parameters. Linear Multilinear Algebra 69:2558–2571. https://doi.org/10.1080/03081087.2019.1682497
Luo Z, Zhou B (2015) On distance spectral radius of trees and fixed maximum degree. Filomat 29:2021–2026
Minc H (1988) Nonnegative matrices. Wiley, New York
Nikiforov V (2014) Analytic methods for uniform hypergraphs. Linear Algebra Appl 457:455–535. https://doi.org/10.1016/j.laa.2014.05.005
Ning W, Ouyang L, Lu M (2013) Distance spectral radius of trees with fixed number of pendant vertices. Linear Algebra Appl 439:2240–2249. https://doi.org/10.1016/j.laa.2013.06.030
Sivasubramanian S (2009) \(q\)-analogs of distance matrices of \(3\)-hypertrees. Linear Algebra Appl 431:1234–1248. https://doi.org/10.1016/j.laa.2009.04.020
Stevanović D, Ilić A (2010) Distance spectral radius of trees with fixed maximum degree. Electron J Linear Algebra 20:168–179. https://doi.org/10.13001/1081-3810.1366
Stevanović D, Ilić A (2010) Spectral properties of distance matrix of graphs. In: Gutman I, Furtula B (eds) Distance in molecular graphs theory. University of Kragujevac, Kragujevac, pp 139–176
Wang Y, Zhou B (2013) On distance spectral radius of graphs. Linear Algebra Appl 438:3490–3503. https://doi.org/10.1016/j.laa.2012.12.024
Wang Y, Zhou B (2018) On distance spectral radius of hypergraphs. Linear Multilinear Algebra 66:2232–2246. https://doi.org/10.1080/03081087.2017.1391167
Wang Y, Zhou B (2020) Extremal properties of the distance spectral radius of hypergraphs. Electron J Linear Algebra 36:411–429. https://doi.org/10.13001/ela.2020.5121
Watanabe S, Ishi K, Sawa M (2012) A \(q\)-analogue of the addressing problem of graphs by Graham and Pollak. SIAM J Discrete Math 26:527–536. https://doi.org/10.1137/110831520
Yu G, Guo S, Zhai M (2017) Distance spectral radius of a tree with given diameter. Ars Combin 134:351–362
Funding
This work was supported by National Natural Science Foundation of China (no. 12071158).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interest.
Additional information
Communicated by Leonardo de Lima.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Li, C., Zhou, B. Minimizing the distance spectral radius of uniform hypertrees with given parameters. Comp. Appl. Math. 42, 272 (2023). https://doi.org/10.1007/s40314-023-02404-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-023-02404-9