1) quasi-strong edge colourings graphs
准强边着色图
1.
This paper uses the quasi-strong edge colourings matrix to discuss the computation of quasi-strong edge colourings graphs for the complete graphs.
使用准强边着色矩阵讨论了完全图的准强边着色图的计数。
2) quasi-strong edge colourings
准强边着色
1.
If a graph G has a proper edge colourings so that the colouring sets of incident edge at all adjacent vertices in the graph G are different from each other,then such an edge colourings is said to be a quasi-strong edge colourings of graph G.
如果图G已有一个合理边着色,使得图G中所有相邻顶点间的关联边着色集合相互不同,则这种边着色称为图G的准强边着色。
2.
If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other,the graph G is said to be a quasi-strong edge colourings.
如果图G有一个合理边上色,使图G的所有相邻顶点的关联边上色集合都互不相同,则称图G为准强边着色。
3) 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.
使用准强边着色矩阵讨论了完全图的准强边着色图的计数。
4) strong edge-coloring
强边着色
1.
In 1985,the famous graph theory expert Erds and Neetil ilconjectured that strong edge-coloring number of a graph is bounded above by 5/4Δ2 when Δ is even and 1/4(5Δ2-2Δ+1) when Δ is odd.
著名图论专家Erds和Neetil对图的强边着色数上界提出了一个猜想:当Δ为偶数时,χ′s(G)≤5/4Δ2;当Δ为奇数时,χ′s(G)≤1/4(5Δ2-2Δ+1),他们给出了当Δ=4的时的最优图。
5) strong edge coloring
强边着色
1.
For a graph G,f is a strong edge coloring if it is proper and any two vertices are incident with different sets of colors.
设 f是图G的一个正常边着色 ,若对G中任意不同的两点u ,v ,着在与u关联的边上的色集和着在与v关联的边上的色集不同 ,则称 f为强边着色。
6) Edge-colored graph
边着色图
补充资料：A1-Cu-Co合金中十次对称准晶单晶体及其衍射图
A1-Cu-Co合金中十次对称准晶单晶体及其衍射图
‘ Al Cu—Co合金中十次对称准晶堕晶体e1)及其衍射圈(z) 中国科学盹垒禹研览听供稿
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条