Minimal energies of trees with given parameters
- 作者：Jianming Zhu ; zhujianming2005@163.com
- 关键词：05C50 ; 05C35 ; 05C90
- 刊名：Linear Algebra and its Applications
- 出版年：2012
- 期刊代码：38_00243795
- 类别：mt
- 出版时间：1 May, 2012
- 卷：436
- 期：9
- 页码：3120-3131
- 文件大小：342 K
摘要
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Let be the set of trees with given order k. Suppose that and be the ordering vertex set of T. We denote by the graph obtained by attaching pendent vertices to vertex of T respectively. Let . In this paper, we determine the trees in with the first and the second minimal energies. As applications, we can characterize the trees with the first and the second minimal energies among the set of trees with given domination number, matching number, independence number respectively.