1) total colouring matrix
全着色矩阵
1.
Behzads total colouring conjecture is proved here for a category of graphs by use of a total colouring structure given by a total colouring matrix supposed.
利用全着色矩阵给出一类图的全着色构造,证明了对于这些图类M。
2.
The total colouring matrix was introduced and the total colouring structure of complete graph of order n was given.
引进了图的全着色矩阵的概念 ,从而给出了n阶完全图全着色的构造 ,并推广到任意n阶图G的最大度Δ(G) =n - 1的情形 ,给出了与猜想等价的命题
2) The matrix of edge colouring
边着色矩阵
3) strong edge colourings
强边着色矩阵
1.
If a graph G has a proper edge colourings such that the incident edge colourings sets between any two vertices in the graph G are different from each other,then such an edge colourings is said to be a strong edge colourings of graph G.
本文利用强边着色矩阵,讨论了完全图的强边着色及其分类,证明了:当n是奇数时,图Kn是一个第二类强边着色图,且χs′(Kn)=Δ(Kn)+1;当n是偶数时,图Kn是一个第三类强边着色图,且χs′(Kn)=Δ(Kn)+2。
4) quasi-strong edge colourings matrix
准强边着色矩阵
1.
This paper uses the quasi-strong edge colourings matrix to discuss the computation of quasi-strong edge colourings graphs for the complete graphs.
使用准强边着色矩阵讨论了完全图的准强边着色图的计数。
5) color matrix
颜色矩阵
6) Hessian matrix
海色矩阵
1.
We constructed a formula through which the inverse of Hessian matrix can be updated from unit matrix.
结合各向异性弹性参数反演,推导出反演所需的梯度向量,梯度向量中Jacobi矩阵各个元素的求取是利用与正演完全相同的方法,并构造了一个公式,从单位阵开始来修改函数的海色矩阵的逆矩阵,这样,不用求海色矩阵及其逆阵就能求函数的极小值,减少了计算量,给出了实际的反演结果。
补充资料：全受全归
1.语出《礼记．祭义》:"父母全而生之，子全而归之，可谓孝矣。不亏其体，不辱其身，可谓全矣。"封建礼教认为人的形体来自父母，应当以完全无亏的身体，还之父母。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条