1) independent set polynomial
独立集多项式
1.
The concept of the independent set polynomial of simple graphs is defined, the relationship between the independent set polynomial and the maching polynomial of the graphs is discussed, the structural characterization of the independent set polynomial of the graphs is also given in the paper.
定义了简单图的独立集多项式，讨论了图的独立集多项式与图的匹配多项式的关系，给出了图的独立集多项式的结构特征。
2.
The transfer-matrix expressions of the independent set polynomial and the Clar covering polynomial of some graphs are given here.
本文利用转移矩阵方法分别给出了某些图类的独立集多项式和一类六角系统的Clar覆盖多项式的转移矩阵表示。
2) independence polynomial
独立多项式
1.
In this paper,we show that the independence polynomials of double stars are unimodal and locate their modes.
证明了双星图的独立多项式是单峰的,并且找到了峰的位置。
3) independent sets of events
项目独立集
5) independent sets
独立集
1.
On cliques and independent sets;
关于团和独立集的一类极值问题
2.
If d(S)+d(T)≥n+1 for every two strongly disjoint independent sets S and T with |S|=s and |T|=t,then.
本文利用独立集的度和得到如下结果：设s和t是正整数,G是(2s+2t+1)-连通n阶图。
3.
Let G be a graph, for any U■V(G), let N(U)=∪_ (u∈U) N(u),d(U)=│N(U)│, we give two results: Let s and t be two positive integers and G be a (2s+2t+1)-connected graph of order n; If d(S)+d(T)≥n+1 for every two strongly disjoint independent sets S and T with│S│=s and │T│=t, respectively, then G is hamiltonian-connected or 1-hamiltonian.
我们给出了两个结果:设s和t是正整数,G是(2s+2t+1)-连通图,且阶为n;若对于任两个强不交独立集ST,│S│=s,│T│=t ,有d(S)+d(T) ≥n +1 ,则G是哈密尔顿连通的或1-哈密尔顿。
6) total independent set
全独立集
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。