首页> 外文会议>International conference on intelligent computing >Note on the Minimal Energy Ordering of Conjugated Trees
【24h】

Note on the Minimal Energy Ordering of Conjugated Trees

机译:关于共轭树的最小能量排序的注意事项

获取原文

摘要

For a simple graph G , the energy E(G) is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix A(G). Gutman proposed two conjectures on the minimal energy of the class of conjugated trees (trees having a perfect matching). Zhang and Li determined the trees in the class with the minimal and second-minimal energies, which confirms the conjectures. Zhang and Li also found that the conjugated tree with the third-minimal energy is one of the two graphs which are quasi-order incomparable. Recently, Huo, Li and Shi found there exists a fixed positive integer N_0, such that for all n> N_0, the energy of the graphs with the third-minimal through the sixth-minimal are determined. In this paper, the N_0 is fixed by a recursive method, and the problem is solved completely.
机译:对于简单图G,将能量E(G)定义为其邻接矩阵A(G)的所有特征值的绝对值之和。古特曼对共轭树(具有完美匹配的树)类别的最小能量提出了两个猜想。张和李确定了该类中具有最小和第二最小能量的树木,这证实了这一猜想。张和李还发现,具有第三最小能量的共轭树是准序不可比的两个图之一。最近,Huo,Li和Shi发现存在一个固定的正整数N_0,因此对于所有n> N_0,确定了从第三最小到第六最小的图的能量。本文通过递归的方法来固定N_0,并彻底解决了这一问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号