|本期目录/Table of Contents|

[1]洪成蹊,晏卫根.具有最小匹配能量的广义仙人掌图[J].集美大学学报(自然科学版),2016,21(5):383-387.
 HONG Cheng-xi,YAN Wei-gen.On the Minimum Matching Energy of Generalized Cacti Graphs[J].Journal of Jimei University,2016,21(5):383-387.
点击复制

具有最小匹配能量的广义仙人掌图(PDF)
分享到:

《集美大学学报(自然科学版)》[ISSN:1007-7405/CN:35-1186/N]

卷:
第21卷
期数:
2016年第5期
页码:
383-387
栏目:
数理科学与信息工程
出版日期:
2016-09-28

文章信息/Info

Title:
On the Minimum Matching Energy of Generalized Cacti Graphs
作者:
洪成蹊晏卫根
(集美大学理学院,福建 厦门 361021)
Author(s):
HONG Cheng-xiYAN Wei-gen
(School of Science,Jimei University,Xiamen 361021,China)
关键词:
匹配能量广义仙人掌图双圈图
Keywords:
matching energygeneralized cacti graphbicyclic graph
分类号:
-
DOI:
-
文献标志码:
A
摘要:
为了研究具有最小匹配能量的广义仙人掌图的结构,利用一些图形变换对图的匹配能量产生影响的相关方法,得到了具有最小匹配能量的广义仙人掌图的结构:在所有顶点数、边数、块为圈的数目和块为双圈图的数目都固定的广义仙人掌图中,G﹡(n,m,r,s)是匹配能量最小的图;在所有顶点数和边数都固定的广义仙人掌图中,G﹡(n,m,1,(m-n)/2)或G﹡(n,m,0,(m-n+1)/2)是匹配能量最小的图。
Abstract:
Some methods of graph-transformation which have effect on matching energy were used to discuss the generalized cacti graph with the minimum matching energy was determined.In this paper,the generalized cacti graph with the minimum matching energy was determined:G﹡(n,m,r,s) has minimum matching energy in the set of generalized cacti graphs with the fixed numbers of vertices,edges,the blocks each of which is a cycle and the blocks each of which is a bicyclic graph; G﹡(n,m,1,(m-n)/2) or G﹡(n,m,0,(m-n+1)/2) has the minimum matching energy in the set of generalized cacti graphs with the fixed numbers of vertices and edges.

参考文献/References:

-

相似文献/References:

备注/Memo

备注/Memo:
-
更新日期/Last Update: 2016-11-19