1) indepedent set dominating set
独立集控制集
1.
In this paper,a necessary condition that a cut vertex belongs to every γ s set of G is discussed,and a necessary and sufficient condition of existing indepedent set dominating set in G is given.
本文讨论了割点属于Ｇ的任一最小集控制集的必要条件，并且给出了Ｇ有独立集控制集的充要条件。
2) independent dominating set
独立控制集
1.
We study the problem of computing minimum independent dominating sets of n intervals on lines in three cases: (1) the lines intersect at a single point, (2) all lines except one are parallel, and (3) one line with t weighted points on it and the minimum independedt dominating set must maximize the sum of the weights of the points covered.
本文研究了在三种情况下直线上的区间图的最小独立控制集的计算问题:1。
3) 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-哈密尔顿。
4) total independent set
全独立集
5) Line-independent sets
线独立集
6) 3-independent set
3-独立集
补充资料：养生要集
养生要集
养生著作。东晋张湛(处度)撰于太元年间(376～396年)。10卷。出《隋书·经籍志》。今佚，其佚文可见于《医心方》等。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条