【摘要】 对于|V(G)3|的连通图G(V,E),若k-正常边染色法满足相邻的边染色集合不同,则称该染色法为k-邻强边染色法,其最小的称为G的邻强边色数。本文用特殊的方法记图的染色,并得到了星和完全等二部图联图的邻强边色数。更多还原

【Abstract】 Let G(V,E)be a simple connected graph,if a proper k-edge f is satisfied with C(u)≠C(v) for uv∈E(G) where C(u)=｛f(uv)｜uv∈E(G)｝,then f is called k-adjacent strong edge coloring of G,which is abbreviated k-ASEC.χ~’_as(G)=min｛k｜k-ASEC of G｝ is called the adjacent strong edge chromatic number of G.in this paper.adjacent strong edge chromatic number of S_m∨K_n,n was obtained.更多还原