On Radenković and Gutman Conjecture for certain Classes of Trees
The Radenković and Gutman conjecture establishes a relationship between the Laplacian eigenvalues of any tree \(T_n\), the star graph \(S_n\), and the path graph \(P_n\), i.e., \({LE}(P_n) \leq {LE}(T_n) \leq {LE}(S_n).\) In this paper, we prove this conjecture for a class of trees with \(n\) vertices and having diameter \(16\) to \(30\).
Authors
- M. T. Rahim (ORCID: https://orcid.org/0000-0003-3304-6518)
- Afeefa Maryam
- Fawad Hussain (ORCID: https://orcid.org/0000-0002-3050-8564)
Publication Details
- Journal
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Published
- 2024-12-31
- DOI
- https://doi.org/10.61091/jcmcc123-19
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00