The minimal Randić energy of trees with given diameter

作者：

Highlights：

• The Randić energy of a graph was introduced in discrete mathematical chemistry as an eigenvalues-based molecular descriptor.

• Let T(n,d;n1,n2,⋯,nd−1) be a caterpillar obtained from a path v0v1⋯vd by adding ni (ni≥0) pendent edges to vi (i=1,⋯,d−1).

• We prove that T(n,d;n−d−1,0,⋯,0) is the unique tree with minimal Randić energy among all trees of order n with diameter d.

摘要

•The Randić energy of a graph was introduced in discrete mathematical chemistry as an eigenvalues-based molecular descriptor.•Let T(n,d;n1,n2,⋯,nd−1) be a caterpillar obtained from a path v0v1⋯vd by adding ni (ni≥0) pendent edges to vi (i=1,⋯,d−1).•We prove that T(n,d;n−d−1,0,⋯,0) is the unique tree with minimal Randić energy among all trees of order n with diameter d.

论文关键词：Tree,Energy,Randić matrix,Randić energy

论文评审过程：Received 11 March 2021, Revised 29 June 2021, Accepted 30 June 2021, Available online 12 July 2021, Version of Record 12 July 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126489