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

作     者：YEH Yeong-Nan 

作者机构：Institute of Mathematics Academia Sinica 

出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)

年 卷 期：2006年第49卷第10期

页      面：1383-1391页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：2004J024 E0540007 National Science Council,NSC: 94-M001-017 

主　　题：matching, Hosoya index, matching polynomial, oriented incident matrix,skew adjacency matrix. 

摘      要：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 prove that the number of matchings of R(G) is completely determined by the degree sequence of vertices of G.