独立集

We also determine the extremal chain polygonal cacti with respect to the number of matchings and of independent sets.

另外，我们确定了关于k-匹配和k-独立集的多边形Cacti链的极值链。

The study includes the fuzzy independent set, fuzzy bases, fuzzy circuits, fuzzy rank, fuzzy hyperplanes, fuzzy closure operator, fuzzy submatroid, quasi-fuzzy graph matroids, fuzzy graphic matroids, fuzzy dual matroid and so on.

研究的内容包括模糊拟阵的独立集，模糊基，模糊圈，模糊秩函数，模糊超平面，模糊闭包算子，模糊子拟阵，准模糊图拟阵，模糊图拟阵，模糊拟阵的对偶和模糊拟阵的运算等等。

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

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

Based on maximal independent set,this paper proposes a distributed algorithm for minimum connected dominating set,and prove...

本文基于极大独立集，提出了一种求解最小连通支配集的分布式算法，并证明了算法的正确性。

For the np-hard problem of constructing minimum connected dominating set in ad hoc networks, this paper proposed a novel distributed mcds constructing algorithm called dmca. dmca constructed a mcds for ad hoc networks based on a maximal independent set. in dmca, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

摘 要：针对无线自组织分组网络中最小连通支配集创建np难问题，提出了一种分布式的最小连通集创建算法dmca.dmca基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

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.

本文讨论了割点属于G的任一最小集控制集的必要条件，并且给出了G有独立集控制集的充要条件。

Wireless sensor networks ; mobile ad hoc networks ; broadcasting ; maximal independent set ; minimum connected dominating set

无线传感器网络；移动自组织网络；广播；极大独立集；最小连通支配集

The minimality of the virtual backbone is assured by designing optimization algorithm. As a result, it can effectively decrease the overhead of control packets dissemination. Simulation resluts show the correctness and the ability of self- renew.Considering the characteristic of fast-moving in wireless ad hoc networks, we construct a virtual backbone with a independent dominating set. This method can avoid sustaining connectivity between backbone nodes and the bakebone network can be rapidly reconstructed as topology change.

对规模较大、移动较频繁的ad hoc网络，用独立支配集构建虚拟骨干网，克服了骨干节点之间必须维护连通性的问题，使得拓扑变化较快时骨干网的重构能快速实现；采用动态按需路由机制，解决了骨干节点要维护路由表的问题；还利用极大独立集的求解得到极小独立支配集；并通过仿真测试了算法的正确性及自恢复能力。

The minimum weight vertex covering set and the maximum weight vertex independent set in the bipartite graph.

最大密度子图；4。二分图的最小点权覆盖集和最大点权独立集。

Weak. Then the relations among rank-weak maps, independent set-reflected maps and closed set-reflected are studied. The isomorphism between matroids is characterized by these new maps, which shows that both weak map and rank-weak map are appropriate morphisms for matroids.

讨论了秩弱映射、反射独立集的映射以及反射闭集的映射之间的关系，利用这些映射给出了拟阵同构的等价刻画，说明了弱映射和秩弱映射也是合适的拟阵态射。

The absorption and distribution of chromium were studied in ryeusing nutrient culture technique and pot experiment.

采用不同浓度K2CrO4(0，0.4，0.8和1.2 mmol/L)的Hoagland营养液处理黑麦幼苗，测定铬在黑麦体内的亚细胞分布、铬化学形态及不同部位的积累。

By analyzing theory foundation of mathematical morphology in the digital image processing, researching morphology arithmetic of the binary Image, discussing two basic forms for the least structure element: dilation and erosion.

通过分析数学形态学在图像中的理论基础，研究二值图像的形态分析算法，探讨最小结构元素的两种基本形态：膨胀和腐蚀；分析了数学形态学复杂算法的基本原理，把数学形态学的部分并行处理理念引入到家实际应用中。