1) chromatically non-uniqueness
非色唯一性
1.
By studying the factorization of adjoint polynomials of a kind of L and Γ-class graphs,we prove,in this paper,the structure characteristics of the chromatically equivalent graphs and the chromatically non-uniqueness of their complement graphs.
通过研究Г及L类图簇的伴随多项式的因式分解,证明了两类图的补图的色等价图的结构性质和非色唯一性。
2.
By studying the factorization of adjoint polynomials of a kind of Γ_(r(2k+p)+1)~(ψ*G(i,j))-class graphs,We prove In this paper that structure characteristics of the chromatically equivalent graphs and chromatically non-uniqueness of their complement graphs.
通过研究Γ_(r(2k+p)+1)~(ψ*G(i,j))类图簇的伴随多项式的因式分解,证明了这类图簇的补图的色等价图的结构性质和非色唯一性。
3.
By studying the factorization of adjoint polynomials of a kind of graphs,We prove In this paper that structure characteristics of the chromatically equivalent graphs and chromatically non-uniqueness of their complement graphs.
通过对一类图簇的伴随多项式因式分解的研究,给出并证明了这类图簇的补图的色等价图的结构性质和非色唯一性。
2) chromatic uniqueness
色唯一性
1.
Then the chromatic uniqueness of graphs G5 and G12 is partially and completely solved,respectively.
2连通的(n,n+4)图是有n个顶点n+4条边的连通图,利用图的色多项式理论研究了两类2连通的(n,n+4)图的色性,由此部分或完全解决了图G5和图G12的色唯一性问题。
2.
The notion of chromatic uniqueness was first introduced by Chao and Whitehead in 1976.
Read给出了它的色多项式并且证明了它的色唯一性。
4) non-uniqueness
非唯一性
1.
The “Non-uniqueness” of Shadow Prices in Linear Programming;
线性规划中影子价格的“非唯一性”
2.
By discussing how to distinct the non-uniqueness of ordinary differential equation starting value,and prompting the result,this essay has obtained the non-uniqueness distinction principle of difference differential equation.
讨论了常微分方程初值问题解存在非唯一性的判别问题,并将所得结论进行推广,得到差分微分方程初值问题解非唯一性的判别准则。
5) chromatically non-unique graph
非色唯一图
6) chromatic uniqueness
色唯一
1.
The chromatic uniqueness of a generalized polygon tree;
一类广义多边形树的色唯一性
2.
The chromatic uniqueness of a family of 5-bridge graphs;
一类5-桥图的色唯一性
补充资料：非色
【非色】
（术语）四大所成及四大所生之法为色。不然者为非色。五蕴之中除色蕴，受想行识之四蕴是也，因而称之为非色之四蕴。
（术语）四大所成及四大所生之法为色。不然者为非色。五蕴之中除色蕴，受想行识之四蕴是也，因而称之为非色之四蕴。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条