On the matching polynomial of subdivision graphs
On the matching polynomial of subdivision graphs
复制标题
DOI：
10.1016/j.dam.2008.05.005
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Weigen Yan;Y. Yeh
中科院分区：
文献类型：
--
作者：
Weigen Yan;Y. Yeh
Let G be a simple graph and let S(G) be the subdivision graph of G, which is obtained from G by replacing each edge of G by a path of length two. In this paper, by the Principle of Inclusion and Exclusion we express the matching polynomial and Hosoya index of S(G) in terms of the matchings of G. Particularly, if G is a regular graph or a semi-regular bipartite graph, then the closed formulae of the matching polynomial and Hosoya index of S(G) are obtained. As an application, we prove a combinatorial identity.
