1) strongly independent sets
强独立集
2) strong essential independent set
强基本独立集
1.
This paper gives a new concept of strong essential independent set, and proves the following theorem: Let k ≥ 2 and let G be a k-connected graph on n vertices such that max{d 1 (x)|x∈ S}≥n/2for every strong essential independent set S on k vertices.
文中给出了强基本独立集的概念,并证明了如下定理:设G是一个具有n个顶点的k-连通图,其中k≥2。
2.
In this paper,we give a new concept of strong essential independent set,and prove the following theorem: Let k≥ 2 and let G be a k-connected claw-free graph on n vertices such that max{d2(x)│x∈S}≥n│2 for every strong essential independent set S on k vertices.
文中给出了强基本独立集的概念,并证明了如下定理:设G是一个具有n个顶点的k-连通无爪图,其中k≥2。
3) strong independent number
强独立数
1.
This paper studeies the strong independent number and strong chromatic number ofgraphs.
本文研究图的强独立数及强色数问题。
4) 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-哈密尔顿。
5) total independent set
全独立集
6) Line-independent sets
线独立集
补充资料：瑞鹤仙 上高节度寿 强村丛书校聚珍版拙轩集
【诗文】：
辕门初射戟。看气压群雄，虹飞千尺。青云试长翮。拥牙旗金甲，掀髯横策。威行蛮貊。令万卒、纵横坐画。荡淮夷献凯，歌来斗印，命之方伯。赫赫功名天壤，历事三朝，许身忠赤。寒陂湛碧。容卿辈、几千百。看皇家图旧，紫泥催去，莫忘尊前老客。愿年年满把黄花，寿君大白。
【注释】：
【出处】：
辕门初射戟。看气压群雄，虹飞千尺。青云试长翮。拥牙旗金甲，掀髯横策。威行蛮貊。令万卒、纵横坐画。荡淮夷献凯，歌来斗印，命之方伯。赫赫功名天壤，历事三朝，许身忠赤。寒陂湛碧。容卿辈、几千百。看皇家图旧，紫泥催去，莫忘尊前老客。愿年年满把黄花，寿君大白。
【注释】：
【出处】：
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条