Skip to main content
SpringerLink
Log in

Distance spectral radii of k-uniform hypertrees with fixed diameter

  • Published:
Journal of Algebraic Combinatorics Aims and scope Submit manuscript

Abstract

The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where \(3\le d\le m-1\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Data availability

No data were used for the research described in the article.

References

  1. Aouchiche, M., Hansen, P.: Distance spectra of graphs: a survey. Linear Algebra Appl. 458, 301–386 (2014)

    Article  MathSciNet  Google Scholar 

  2. Balaban, A.T., Ciubotariu, D., Medeleanu, M.: Topological indices and real number vertex invariants based on graph eigenvalues or eigenvectors. J. Chem. Inf. Comput. Sci. 31, 517–523 (1991)

    Article  Google Scholar 

  3. Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland, Amsterdam (1989)

    Google Scholar 

  4. Du, Z.B., Ilić, A., Feng, L.H.: Further results on the distance spectral radius of graphs. Linear Multilinear Algebra 61, 1287–1301 (2013)

    Article  MathSciNet  Google Scholar 

  5. Edelberg, M., Garey, M.R., Graham, R.L.: On the distance matrix of a tree. Discrete Math. 14, 23–39 (1976)

    Article  MathSciNet  Google Scholar 

  6. Erey, A.: Maximal distance spectral radius of 4-chromatic planar graphs. Linear Algebra Appl. 618, 183–202 (2021)

    Article  MathSciNet  Google Scholar 

  7. Graham, R.L., Lovász, L.: Distance matrix polynomials of trees. Adv. Math. 29, 60–88 (1978)

    Article  MathSciNet  Google Scholar 

  8. Graham, R.L., Pollack, H.O.: On the addressing problem for loop switching. Bell Syst. Tech. J. 50, 2495–2519 (1971)

    Article  MathSciNet  Google Scholar 

  9. Gutman, I., Medeleanu, M.: On the structure-dependence of the largest eigenvalue of the distance matrix of an alkane. Indian J. Chem. A 37, 569–573 (1998)

    Google Scholar 

  10. Hakimi, S.L., Yau, S.S.: Distance matrix of a graph and its realizability. Quart. Appl. Math. 22, 305–317 (1965)

    Article  MathSciNet  Google Scholar 

  11. Lin, H.Y., Zhou, B.: Distance spectral radius of uniform hypergraphs. Linear Algebra Appl. 506, 564–578 (2016)

    Article  MathSciNet  Google Scholar 

  12. Lin, H.Y., Zhou, B.: On distance spectral radius of uniform hypergraphs with cycles. Discrete Appl. Math. 239, 125–143 (2018)

    Article  MathSciNet  Google Scholar 

  13. Lin, H.Y., Zhou, B.: On least distance eigenvalue of uniform hypergraphs. Taiwanese J. Math. 22, 1289–1307 (2018)

    Article  MathSciNet  Google Scholar 

  14. Liu, X.X., Wang, L.G., Li, X.H.: Distance spectral radii of \(k\)-uniform hypertrees with given parameters. Linear Multilinear Algebra 69(14), 2558–2571 (2021)

    Article  MathSciNet  Google Scholar 

  15. Lu, L., Huang, Q.X., Huang, X.Y.: The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\). J. Algebraic Combin. 45, 629–647 (2017)

    Article  MathSciNet  Google Scholar 

  16. Oboudi, M.R.: Distance spectral radius of complete multipartite graphs and majorization. Linear Algebra Appl. 583, 134–145 (2019)

    Article  MathSciNet  Google Scholar 

  17. Sivasubramanian, S.: \(q\)-analogs of distance matrices of 3-hypertrees. Linear Algebra Appl. 431, 1234–1248 (2009)

    Article  MathSciNet  Google Scholar 

  18. Wang, Y.N., Zhou, B.: On distance spectral radius of hypergraphs. Linear Multilinear Algebra 66, 2232–2246 (2018)

    Article  MathSciNet  Google Scholar 

  19. Xiao, P., Wang, L.G., Du, Y.F.: The first two largest spectral radii of uniform supertrees with given diameter. Linear Algebra Appl. 536, 103–119 (2018)

    Article  MathSciNet  Google Scholar 

  20. Xue, J., Lin, H.Q., Shu, J.L.: On the second largest distance eigenvalue of a block graph. Linear Algebra Appl. 591, 284–298 (2020)

    Article  MathSciNet  Google Scholar 

  21. Yu, G.L., Guo, S.G., Zhai, M.Q.: Distance spectral radius of a tree with given diameter. Ars Combin. 134, 351–362 (2017)

    MathSciNet  Google Scholar 

  22. Zhang, X.L.: On the distance spectral radius of some graphs. Linear Algebra Appl. 437, 1930–1941 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referees for valuable comments, suggestions and corrections which improved the presentation of this paper.

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, 710129, Shaanxi, People’s Republic of China

    Xiangxiang Liu & Ligong Wang

  2. Xi’an-Budapest Joint Research Center for Combinatorics, Northwestern Polytechnical University, Xi’an, 710129, Shaanxi, People’s Republic of China

    Xiangxiang Liu & Ligong Wang

Authors
  1. Xiangxiang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ligong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ligong Wang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supported by the National Natural Science Foundation of China (No. 11871398) and the Natural Science Basic Research Plan in Shaanxi Province of China (Program No. 2024JC-YBQN-0015).

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, X., Wang, L. Distance spectral radii of k-uniform hypertrees with fixed diameter. J Algebr Comb (2024). https://doi.org/10.1007/s10801-024-01316-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10801-024-01316-z

Keywords

Mathematics Subject Classification

Search

Navigation