一些图的强邻边着色

Coloring Adjacent Strong Edges of Some Graphs

设G=(V,E)是一个图。图G的一个k强邻边着色是图G的一个正常k边着色c,使得对每个uv∈E都有C[u]≠C[v],这里C[u]={c(uw):uw∈E},简写为k-ASEC。在文章中,我们分别考虑了复合图Pn[Sm],笛卡尔积Cn×Pm和θk图的k-ASEC。

Let G=（V, E） be a graph. An k-adjacent strong edge coloring of G, abbreviated k--ASEC, is a proper k--edge coloring c such that C[u]≠C[v] for every uv∈E,where C[u]={c（uw） ： uw∈E}. In this paper we discuss respectively the k--ASEC of the composition graph Pn[Sm], the cartesian product graph Cn×Pm and the graph θk.