三条路并的极值能量及一类图的能量排序  

The union of three paths′extreme energy and energy ordering of a class of graphs

作　　者：葛云鹏[1] 火博丰[1] 王春云[1] 刁强强 

机构地区：[1]青海师范大学数学系,青海西宁810008

出　　处：《纯粹数学与应用数学》2015年第4期387-402,共16页Pure and Applied Mathematics

基　　金：国家自然科学基金(11261047)

摘　　要：拟序是图能量排序中一种有效方法,基于该方法,已经得到了大量图类的极值能量排序的结果.Gutman给出了点数和为n的两条路的并的能量排序,而三条路的并的能量排序没有一个理想的结论.本文利用拟序法给出点数和为n的三条路的并的极值能量及一类图能量的排序.Quasi-order can effectively solve many problems for extreme energy. Based on this method, many results for extreme energy ordering have been determined. Gutman has given the ordering for the union of two paths′ energy, but there is not a good conclusion for the union of three paths′ energy ordering, this paper determined the union of three paths′ extreme energy by quasi-order method and given the energy ordering of a class of graphs.

关 键 词：图能量 三条路的并 排序 拟序 

分 类 号：O157.5[理学—数学]