1) strong vertex rendering
强着色
2) strong totol coloring
强全着色
3) 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的时的最优图。
4) 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) adjacent strong edge coloring
邻强边着色
1.
What s adjacent strong edge coloring is meaning that if a proper kedge coloring σ is satisfied with c(u)≠c(v), where c(u)={σ(uv)|uv∈E(G)}, then σ is called kadjacent strong edge coloring of G.
则其邻强边染色是指对于图G(V,E),若σ:E→{1,2,…,n}为其一正常着色, u,v∈V,当uv∈E(G)时,若c(u)≠c(v),其中c(u)={σ(uv)｜uv∈E(G)},则称σ为G的邻强边着色。
补充资料：椐椐强强
1.相随貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条