Hosoya指数第二小、第三小的双圈图  

Bicycle graphs with the second and third Hosoya index

作　　者：李莎[1] 卓玛措[1] 王微[2] 

机构地区：[1]青海师范大学数学系,青海西宁810008 [2]唐山市第四十九中学,河北唐山063000

出　　处：《东北师大学报（自然科学版）》2014年第2期45-50,共6页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(11161037;11101232)

摘　　要：双圈图是边数等于点数加1的连通图.一个图的Hosoya指数是这个图的所有匹配的个数.在已有结论的基础上通过加边,并利用求指数的删边、删点公式,刻画了具有m-匹配的Hosoya指数第二小、第三小的双圈图.Bicycle graphs are connected graphs with re=n＋ 1 ,where m denotes the number of edges and n denotes the number of vertices. The Hosoya index of a graph G,denoted by Z（G） ,is defined as the total number of matchings （independent edge subsets）,including the empty edge set,of a graph. On the basis of the existing conclusions, we characterize the bicycle graphs with the second and third Hosoya index with m-matching by adding edges and using known formulas.

关 键 词：HOSOYA指数 m-匹配 双圈图 

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