具有最大Merrifield-Simmons指标的M_n^k图  

M_n^k Graphs with Maximal Merrifield-Simmons Index

作　　者：张继新[1] ZHANG Ji-xin(Second Middle School in Linzi,255400,Zibo,Shandong,PRC)

机构地区：[1]淄博市临淄区第二中学,山东省淄博市255400

出　　处：《曲阜师范大学学报（自然科学版）》2019年第1期47-50,共4页Journal of Qufu Normal University(Natural Science)

摘　　要：一个图的Merrifield-Simmons指标σ(G)定义为图G的所有的点独立集数目之和.该文把有n个顶点的满载单圈图固定k(k≥l,l为圈的长)个悬挂点且圈上每个点都至少连一个悬挂点的单圈图记为Mkn图.该文描述了Mkn图的第一大Merrifield-Simmons指标及其极图特征.The Merrifield-Simmons indexσ(G)of a graph is defined as the total number of vertex independent sets of G.Let Mn^k be the set of unicyclic graphs with the property that there is at least a pendent vertex connecting every vertex of its cycle.In this paper,we consider the maximal Merrifield-Simmons index of Mn^k graphs,and characterize the extremal graph.

关 键 词：Mn^k图 MERRIFIELD-SIMMONS指标 极图 

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