期刊文献+

关于三叶图的能量变换

On Energy Changing of 3-leaves Graphs
下载PDF
导出
摘要 图的能量是图的邻接矩阵的特征值的绝对值之和,记为E(G)。用G(n,r)表示为具r个圈的n阶仙人掌图集,当r=3且每个圈为三角形时,称图G为三叶图。主要讨论n阶三叶图之间的能量变换关系。首先得到m(G,k)与b_i(G)的关系;其次得到此类图之间满足变换关系Ⅰ、Ⅱ下的能量关系;并证得当T≌S_k,k≥2时的三叶图具有最小能量。 The energy of a graph is defined as the sum of the absolute value of eigenvalues of the adjacent matrix on the graph. G ( n, r) denotes the set of n order cacti graph with r cycles. When r = 3 and every cycls is triangle, it is called n order 3-leaves graph. In this paper, we mainly study the energy transformation raltion of 3-leaves graphs. Firstly, we get the relation between m ( G, k ) and bi (G). Secondly, we obtain the energy connection between the graphs which satisfy the transfonntion Ⅰ or Ⅱ. And we get that the 3-leaves graphs have the minimum energy when T≌Sk, k ≥2.
作者 陈志文
出处 《华东交通大学学报》 2009年第3期88-91,共4页 Journal of East China Jiaotong University
关键词 三叶图 特征多项式 图的能量 3-leaves graph characteristic polynomial energy of graph
  • 相关文献

参考文献7

  • 1Bondy J A and Murty U S R. Graph Theory with Applications[ M] ,Amsterdam:North-Holland, 1976.
  • 2Yan Weigan, Ye Luzhen. On the maximal energy and the Hosoya indexof a type of trees with many pendent vertices[ J]. Match Commun Math Comput Chem,2005,53:449- 459.
  • 3Hua Hongbo,Wang Maolin. Unicychc graphs with given number of pendent vertices and minimal energy[J]. Linear Algera and its Application,2007,24:1 - 14.
  • 4Chen Ailian, An Chang, Wai C S. Energy ordering of unicycle graphs[J]. Match Commun Math Comput Chem,2006,55:95 - 102.
  • 5Zhou Bo, Li Feng. On minimal energy of trees of a prescribed diameter[J]. Journal of Mathematics Chemistry,2006,39:465- 473.
  • 6Ye Luzhen, Chen Rongsi. Ordering of trees with a given bipartition by their energies and hosoya indices[ J ]. Match Commun Math Comput Chem,2004,52:193 - 208.
  • 7Yu Aimei, Lu Xuezheng. Minimum energy on tree with k-pendent vertices[ J ]. Linear Algera and its Application,2006,418:625- 633.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部