似星树匹配能的极图  

The Extremal Graphs with Respect to the Matching Energy in Starlike Trees

作　　者：黄桂花 邓汉元[2] HUANG Gui-hua;DENG Han-yuan(Beijing Vocational College of Labour and Social Security,Beijing 102200,China;College of Mathematics and Computer Science,Hunan Normal University,Changsha 410081,China)

机构地区：[1]北京劳动保障职业学院,中国北京102200 [2]湖南师范大学数学与计算机科学学院,中国长沙410081

出　　处：《湖南师范大学自然科学学报》2019年第2期80-83,共4页Journal of Natural Science of Hunan Normal University

基　　金：湖南省自然科学基金资助项目(13JJ3053)

摘　　要：一个图G的能量等于图G的特征值的绝对值。最近Gutman和Wagner提出图G的匹配能定义为■,其中u1,u2,…,un为图G的匹配多项式的根。在此文中,我们主要确定了似星树匹配能的极图。The energy of a graph G is equal to the sum of absolute values of its eigenvalues of G.The matching energy(ME)of a graph G is recently proposed by Gutman and Wagner,who pointed out that its chemical applications could be traced back to the 1970s.It is defined as the sum∑ni=1|ui|,where u 1,u 2,…u n are the zeros of matching polynomial of G.In this paper,we determine the extremal graphs for starlike trees.

关 键 词：k-匹配 匹配能 匹配多项式 极图 似星树 

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