|
|||||
|
|
On the number of matchings of graphs formed by a graph operation |
|
| Authors: | YAN Weigen YEH Yeong-Nan |
| Affiliation: | 1. School of Sciences, Jimei University, Xiamen 361021, China;Institute of Mathematics, Academia Sinica, Taipei 11529, China 2. Institute of Mathematics, Academia Sinica, Taipei 11529, China |
| Abstract: | 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. |
| Keywords: | matching Hosoya index matching polynomial oriented incident matrix skew adjacency matrix |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ | |