J4

• 数学 • Previous Articles     Next Articles

On Adjacent Strong Edge Coloring of Some Regular Graphs

WANG Cuiqi1, MIAO Zhengke2   

  1. 1. College of Sciences, China University of Mining & Technology, Xuzhou 221008, Jiangsu Province, China;2. Department of Mathematics, Xuzhou Normal University, Xuzhou 221008, Jiangsu Province, China
  • Received:2007-06-12 Revised:1900-01-01 Online:2008-05-26 Published:2008-05-26
  • Contact: WANG Cuiqi

Abstract: We studied ASEC of a class of graphs G(n,n,r)(n=1,2(mod 3)), then proved the conjecture that any graph G(V,E)(G(V,E)≠C5)with |V(G)|≥3 satisfies Δ(G)≤χ′αs(G)≤Δ(G)+2 is correct.

Key words: regular partite graph, adjacent strong edge coloring, adjacent strong edge chromatic number

CLC Number: 

  • O157.5