Solutions to unsolved problems on the minimal energies of two classes of trees

Yongqiang Bai and Hongping Ma

Applied Mathematics and Computation, 2016, vol. 286, issue C, 49-56

Abstract: The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. Let Tn,p,Tn,d be the set of all trees of order n with p pendent vertices, diameter d, respectively. In this paper, we completely characterize the trees with second-minimal and third-minimal energy in Tn,p (Tn,d, respectively) for 4≤p≤n−9 (10≤d≤n−3, respectively), which solves the problems left in Ma (2014).

Keywords: Minimal energy; Tree; Pendent vertex; Diameter (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031630248X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:286:y:2016:i:c:p:49-56

DOI: 10.1016/j.amc.2016.04.006

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().