On the number of matchings of graphs formed by a graph operation

• 作 者: YAN Weigen YEH Yeong-Nan
• 机 构: SchoolofSciences,InstituteofMathematics
• 出 处: 黑龙江科技学院学报
• 发表日期: 2006年10期
• 关键词: matching Hosoya index matching polynomial oriented incident matrix skew adjacenc

Let G be a simple graph. Define R(G) to be the graph obtained from G by adding a new vertex e* corresponding to each edge e = (a, b) of G and by joining each new vertex e* to the end vertices a and b of the edge e corresponding to it. In this paper, we pr