基本释义:

独立集

网络释义

1)independent set,独立集

2)independent sets,独立集

3)total independent set,全独立集

4)Line-independent sets,线独立集

5)3-independent set,3-独立集

6)independent subsets,独立子集

用法和例句

In this Paper we prove the following result: Let G be a z - connected claw - free graph, If for all independent set of Sk+1, there exist u .

本文证明了如下结果：设 Ｃ是ｎ阶２连通无爪图，Ｋ为连通度，若对 Ｃ中每一个阶为Ｋ＋ １的独立集 Ｓ，存在ｕ，ｖ∈ Ｓ，有 １Ｎ（ｕ） １≥（ｎ－ ２ｋ）１４，则 Ｃ是Ｈａｍｉｌｔｏｎ图。

Bauer, Broersma and Li proved that for an independent set S=u,v,w, d(u)+d(v)+d(w)≥n+k ,then G is Hamiltonian.

Bauer等人已证明 :如果对任意三点独立集S =u ,v ,w ,都有d(u) +d(v) +d(w)≥n +k ,则G是Hamilton图 。

If G is a D—circle graph,and to each independent set with point:t+1(t≤δ),s={x_0,x_1,…, x_t},there is|N(s{x_i}|>t(n-1),then G is a Hamilton Graph.

给出了 D—圈图成为哈密顿图的一个充分条件:如果 G 是 D—圈图,且对每个 t+1(t≤δ)个点的独立集 S={x_0,x_1,…,x_t},有|S{x_i}|>t(n—1),则 G 是哈密顿图。

On cliques and independent sets;

关于团和独立集的一类极值问题

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阶图。

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-哈密尔顿。

The nodes in forward node list are pided into several independent subsets which can rebroadcast simultaneously wit.

提出了一种能量高效的无冲突的广播策略,该策略利用所有两跳邻节点的剩余能量和度等信息选择前向转播节点,并将前向转播节点分为相互不干扰的独立子集,统一为独立子集设置退避时间,避免冲突的发生。

Counting the Matchings, Independent Sets and Maximal Independent Sets for Several Classes of Graphs

几类图的匹配、点独立集、点极大独立集的计数

On complementation, we obtain the list of all maximal independent sets of G.

取其补集，得到G的所有极大独立集。

A Study on Maximum Independent Set Problem for the Evolution Algorithm;

最大独立集问题的一类进化算法研究

Study on Maximum Independent Set Problem and Its Grown-Up Algorithm;

最大独立集问题及其成长算法的研究

The Numbers of Matchings and Independent-sets with Respect to the Triangular Lattice L_n

一类三角系统的匹配数与点独立集数

The Logical and Recursive Algorithm of Maximal Independent Set and Minimal Covering Set;

极大独立集与极小覆盖集的逻辑及递归算法

Maximal Non-ID-f actor-critical Graphs

极大非独立集可削去的因子临界图(英文)

The Study on Structure of Fuzzy Independent Set System and Fuzzy Matroid;

模糊独立集系统及模糊拟阵的结构研究

independent bank

未参加集团或联营的独立银行

Council on the Collective Security of the Commonwealth of Independent States

独立国家联合体集体安全理事会

Floret 1. An inpidual small flower of a clustered inflorescence, e.g. daisy (Bellis).

小花：1.簇集花序上独立的小花，如雏菊。

The Investigations of Knockout Reaction Based on the Independent α Cluster Model;

在独立α集团模型下敲出反应的研究

Merchant Groups, Private Property, and the American Revolution;

商人集团、私有财产与北美独立战争

Ownership Concentration,Board Independence and Governance Environment:Evidence Based on Listed Companies in China

股权集中度、董事会独立性与治理环境

Establising Independent Security Mechanism Adapting to Collective Contract System;

建立适应集体合同制度的工会独立性保障机制

Public Colleges and Universities of Independent Colleges and Applied Research Funding

公立高校独立学院资金筹集与应用研究

Grant assemblies access to file-based isolated storage

授予程序集对基于文件的独立存储的访问权限

There is a limit to the legitimate interference of collective opinion with inpidual independence;

集体意见对个人独立的合法干预是有限度的；