摘要
一个图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.
作者
黄桂花
邓汉元
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)
出处
《湖南师范大学自然科学学报》
CAS
北大核心
2019年第2期80-83,共4页
Journal of Natural Science of Hunan Normal University
基金
湖南省自然科学基金资助项目(13JJ3053)
关键词
k-匹配
匹配能
匹配多项式
极图
似星树
k-matching
matching energy
matching Polynomial
extremal graph
starlike trees