两类图族的Merrifield-Simmons指标  

The Merrifield-Simmons index of the two types of graph family

作　　者：苏晓海 孙泽清 俞天仕 高云 任胜章[1] SU Xiaohai;SUN Zeqing;YU Tianshi;GAO Yun;REN Shengzhang(School of Mathematics and Computer Science,Shaanxi University of Technology,Hanzhong 723001,China)

机构地区：[1]陕西理工大学数学与计算机科学学院,陕西汉中723001

出　　处：《安徽大学学报（自然科学版）》2022年第1期32-36,共5页Journal of Anhui University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(11761057);陕西省教育厅自然科学基金资助项目(15JK1143)。

摘　　要：路粘完全图G(P_(m),K_(n))是指由一个m个顶点的路的每个顶点上粘接一个n阶完全图得到的连通图,圈粘完全图G(C_(m),K_(n))是指由一个圈图C m的每个顶点上粘接一个n阶完全图得到的连通图.论文通过研究完全图、路粘完全图和圈粘完全图的Merrifield-Simmons指标,刻画出了路粘完全图和圈粘完全图的Merrifield-Simmons指标的计算公式,并给出了其证明过程.A path glued complete graph G(P_(m),K_(n))was a connected graph obtained by gluing a complete graph of order n on each vertex of a path graph P m.A circle glued complete graph G(C_(m),K_(n))was a connected graph obtained by gluing a complete graph of order n on each vertex of a cycle graph C m.In this paper,by studying the Merrifield-Simmons index of complete graph,path glued complete graph and circle glued complete graph,the computational formula of the Merrifield-Simmons index of those graph was given.

关 键 词：完全图 独立集 MERRIFIELD-SIMMONS指标 

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