1) edge clique cover
边团覆盖
1.
Opsut showed that,for any graph G,the competition number of G is less than or equal to the edge clique cover number of G in 1982.
Opsut在1982年给出了任意图G的竞争数小于等于其边团覆盖数的结果。
2) edge clique cover number
边团覆盖数
1.
Opsut showed that,for any graph G,the competition number of G is less than or equal to the edge clique cover number of G in 1982.
Opsut在1982年给出了任意图G的竞争数小于等于其边团覆盖数的结果。
3) clique covering number
团覆盖数
1.
This paper discusses clique covering number and clique partition number on the line graph and total graph of n Sun graph.
主要讨论ｎ－太阳图的线图及全图的团覆盖数和团划分数，得出了ｎ－太阳图的线图及全图的覆团盖数与团划分数相等且都是ｎ的倍数。
4) Clique-Cover
团覆盖
1.
Solution to Clique-Cover Problem in WDM Optical Network Optimization Based on Genetic Algorithm;
用遗传算法求解WDM全光网络优化中的团覆盖问题
5) edge coverage
边角覆盖
1.
This paper narrates solutions to the edge coverage problem of powder coatings from three aspects of outward design change, spraying technology improvement and formula modification.
从改变被涂物外观设计、改进喷涂工艺和调整粉末涂料配方设计三方面着手阐述了粉末涂膜边角覆盖问题的解决方法。
6) edge covering number
边覆盖数
1.
Denote by ω(G) the edge covering number of G,and by g(G) the girth of G.
设G为图,用ω(G)和g(G)分别表示图G的边覆盖数和围长。
补充资料：团头团脑
1.形容体形圆胖。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条