【摘要】 一个图G的边染色被称为邻点可区别的,如果满足图G中任意两个相邻点所关联的边所染颜色的集合不同。研究了图路和轮的广义Mycielski图的邻点可区别的边染色并证明它满足邻点可区别的边染色猜想。更多还原

【Abstract】 A adjacent vertex distinguishing edge coloring of graph G is a proper edge coloring of graph G such that any two adjacent vertices’coloring sets are not the same.In this paper we shall give adjacent vertex distinguishing edge chromatic number of Mn(Pm)and Mn(Wm)and prove that it satisfies adjacent vertex distinguishing edge coloring conjecture.更多还原