1) distinguishing number
可区别数
1.
On the distinguishing number of the cube of the hypercube;
超立方体三次幂的可区别数研究
2.
On distinguishing number of cube of n(≤7)-dimensional hypercube;
维数不超过7的超立方体三次幂的可区别数
2) edge distinguishing number
边可区别数
3) vertex-distinguishing total chromatic number
点可区别全色数
1.
Asymptotic behaviour of the vertex-distinguishing total chromatic numbers of n-cube;
n-方体的点可区别全色数的渐近性态
2.
In this paper,we obtain the vertex-distinguishing total chromatic number of Pm∨Sn.
对一个正常的全染色满足不同点的点及其关联边染色的色集不同时,称为点可区别全染色,其所用最少染色数称为点可区别全色数。
3.
The vertex-distinguishing total chromatic numbers on Mycielski s graphs of path,cycle,complete graph,star,fan and wheel are discussed and given.
讨论并得到了路、圈、完全图、星、扇、轮的Mycielski图的点可区别全色数。
4) vertex-distinguishing edge chromatic number
点可区别边色数
1.
On the vertex-distinguishing edge chromatic number of P_m V W_n;
图P_m V W_n的点可区别边色数
2.
The vertex-distinguishing edge-coloring of F_m∨P_n are studied and vertex-distinguishing edge chromatic number of F_m∨P_n are obtained.
研究了Fm∨Pn的点可区别边染色,给出了Fm∨Pn的点可区别边色数。
3.
In this paper,we have given the vertex-distinguishing edge chromatic number of Cm∨Cn and Cm∨Sn.
对图G的正常边染色,若满足不同点的点所关联边色集合不同,则称此染色法为点可区别的边染色法,其所用最少染色数称为该图的点可区别边色数。
6) distinguishability
[英][dis,tiŋgwiʃə'biliti] [美][dɪs,tɪŋgwɪʃə'bɪlətɪ]
可区别性
1.
Then aimed at their disadvantage of low categorization accuracy and excessive great time consumption for the categorization due to the existence of excessive features or worse features, the feature calibration and evaluation on reliability, distinguishability and independence are conducted by using the rule of feature selection.
针对特征过多或欠佳而造成分类精度不高或分类实时性差的缺点,引入特征选取模型对特征进行可靠性、可区别性及独立性的标定及测评。
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条