k-树的极值无符号的拉普拉斯Estrada指标和Estrada指标（英文）  

On k-trees with Extremal Signless Laplacian Estrada Index and Estrada Index

作　　者：朱忠熏[1] 邹鑫 江美英 Zhu Zhongxun;Zou Xin;Jiang Meiying;Zou Xin(College of Mathematics and Statistics,South.Central University for Nationalities,Wuhan 430074,China)

机构地区：[1]中南民族大学数学与统计学学院,武汉430074

出　　处：《中南民族大学学报（自然科学版）》2018年第1期154-158,共5页Journal of South-Central University for Nationalities：Natural Science Edition

基　　金：国家民委自然科学基金资助项目(14ZNZ023);中南民族大学研究生科研创新基金资助项目

摘　　要：图G的无符号的拉普拉斯Estrada指标SLEE(G)(Estrada指标EE(G))定义为SLEE(G)=n∑i=1eqi(EE(G)=n∑i=1eλi).设Tkn为n阶k-树的集合.利用数学分析中幂级数和代数图论中谱距的方法,建立了这两类指标的伪序,结合反证法,刻画了Tk n中具有第一、第二最大的无符号的拉普拉斯Estrada指标(Estrada指标)的极值图.The signless Laplacian Estrada index SLEE(G)(resp.Estrada index EE(G))of a graph G is defined as SLEE(G)=Σn i=1 eqi(resp.EE(G)=Σn i=1 eλi).Let Tk n be the set of the k-trees of order n.In this paper,by the methods on power series in mathematical analysis and spectral moment in algebra graph theory,the pseudo?order on the two indices was obtained.Further by contradiction,the extremal graphs among Tk n having the first,the second largest signless Laplacian Estrada index(resp.Estrada index)were characterized.

关 键 词：k-树 无符号拉普拉斯Estrada指标 Estrada指标 

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