1) perfect matching
完美对集
1.
On the theoretical basis of the necessary and sufficient conditions for the perfect matching derived by Tutte,a sufficient condition is further derived as follows in this paper,when the number of vertex in simple graph G is even number,and the minimum degree number of vertex is δ≥υ/2-1 in simple graph G.
在Tutte关于完美对集存在的充要条件基础上,针对具有偶数个(υ个)顶点,且顶点的最小度数δ≥υ/2-1的简单图G,通过构造的连接方法,论证了图G中有完美对集的充分条件。
2) fractional perfect matching
分数完美对集
3) Perect addition sets
完美加集
4) perfect set
完美集合
1.
On 2-perfect sets and the corresponding perfect numbers from 3 to 18
关于3-18的2-完美集合与对应的完美数
5) perfect neighborhood set
完美邻域集
1.
For any tree T, we give an Algorithm (A) with polynomial time complexity to get the perfect neighborhood set in T.
然后给出了由T的一极大无冗余集生成完美邻域集的多项式时间复杂度算法(B),并依此算法证明了若S为T的任一极大无冗余集,则T存在一独立完美邻域集U且｜U｜≤｜S｜。
6) perfect domination set
完美控制集
1.
The domination sets and perfect domination sets in hypergraphs are researched, and the conditions of sufficient and necessary of domination sets and perfect domination sets are given.
研究超图的控制集和完美控制集并给出超图的控制集和完美控制集存在的充分必要条件。
补充资料：对集
数与数之间的冲突或弥合构成的新数群。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条