GENERAL-CLASS OF GRAPH POLYNOMIALS

被引：38

作者：

FARRELL, EJ

机构：

[1] Department of Mathematics, University of the West Indies, St. Augustine

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1979年 / 26卷 / 01期

关键词：

D O I：

10.1016/0095-8956(79)90049-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let F be a family of connected graphs. With each element α ∈ F, we can associate a weight wα. Let G be a graph. An F-cover of G is a spanning subgraph of G in which every component belongs to F. With every F-cover we can associate a monomial π(C) = Παwα, where the product is taken over all components of the cover. The F-polynomial of G is Σπ(C), where the sum is taken over all F-covers in G. We obtain general results for the complete graph and complete bipartite graphs, and we show that many of the well-known graph polynomials are special cases of more general F-polynomials. © 1979.

引用

页码：111 / 122

页数：12