首页|Ordering of the trees with a perfect matching by minimal energies
Ordering of the trees with a perfect matching by minimal energies
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
The ordering of the trees with a perfect matching according to minimal energies is investigated. Using a new method proposed here, we obtain the preceding trees in the increasing order of their energies within the class under consideration for n >= 3,where 2n is the vertex number of the tree. We deduce the first 11, 12, 13, 14, 12, 9, 16, and 21 trees for n >= 21, 15 <= n <= 20. n = 14, 10 <= n <= 13, n = 9, n = 8, n = 7, and n = 6, respectively. For n = 5, 4, 3, we list all the trees in the increasing order of their energies.
TreePerfect matchingOrderingMinimal energy
Wang, WH、Kang, LY
展开 >
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China.
NSTL
Elsevier
