新疆大学学报(自然科学版)

1989, (01) 1-4

[打印本页] [关闭]
本期目录(Current Issue) | 过刊浏览(Past Issue) | 高级检索(Advanced Search)

Matching Polynomials of Special Graphs
Matching Polynomials of Special Graphs

摘要(Abstract):

<正> 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).

关键词(KeyWords):

Abstract:

Keywords:

基金项目(Foundation):

作者(Author):

Email:

扩展功能
本文信息
服务与反馈
本文关键词相关文章
本文作者相关文章
中国知网
分享