节点文献

Matching Polynomials of Special Graphs

免费订阅

【Author】 Zhang Fuji;Zheng Maolin(Dept of Math,Xinjiang University)

【摘要】 <正> Farrell in [1] and Godsil and Gutman in [2] gave different definitions about matching polynomials ?? this paper we use the definition of [1] If G is a graph,m(G,i) will denote the number of matchings in G,i.e.,the number of selections of i independent edges of G.If i=0,We define m(G,0)=1.If G has n vertices,we call the polyrnomial ??? to be the matching polynomial of G.By ? we denote the complement of G obtained by deleting the edges of G from the complete graph ? denote the bipartite graph with bipartition m and n By ? we denote the bi-complement of ? obtained by deleting the edges of ?from ? (where ? is the complete bipartite graph with bipartition m and n).

  • 【被引频次】1
  • 【下载频次】10
节点文献中: 

本文链接的文献网络图示:

浏览历史:
下载历史: