摘要
以G(a, 4, b)(a> 1, b> 1)表示a+b+4个点的心形图.从匹配多项式的定义出发,通过递推关系式刻画出了这类心形图的匹配能级和它们的Hosoya指标的全排序.
The G(a,4,b)(a≥1,b≥1)is the graph with a+b+4 vertice.In this paper,Based on the definition of matching polynomial,we describe the matching energy levels and the full order of Hosoya index of this kind of heart-shaped graph by recursive relation.
作者
吴量
刘小花
汪一航
Wu Liang;Liu Xiaohua;Wang Yihang(Faculty of Science,Ningbo University,Ningbo 315211,China;School of Mathematics and Statistics,Qinghai Nationalities University,Xining 810007,China)
出处
《纯粹数学与应用数学》
2019年第1期115-122,共8页
Pure and Applied Mathematics
基金
浙江省自然科学基金(LY15A010005)
