Vol.40 No.12

Journal of Xi'an Jiaotong University

Jan.2006

retue.gif (1614 ×Ö½Ú)

zwb.gif (1647 ×Ö½Ú)

Adjacent Strong Edge Chromatic Number of ª«Sm¡ÅPnª«
Zhang Yudong1£¬Hao Zijun1£¬2£¬Chao Fugang1£¬He Shanglu1£¬Zhang Zhongfu1
(1.College of Mathematics£¬Physics £¦ Software Engineering£¬Lanzhou Jiaotong University£¬Lanzhou 730070, China; 2.Department of Information and Calculating Science£¬The Second Northwest National University£¬ Yinchuan 750000,China)

Abstract£ºTo resolve the algorithm of the chromatic number of a graph£¬a special method is adopt to remember the coloring process of graph£¬and the method does different jobs for four given cases during the coloring process.The adjacent strong edge chromatic number of join graph of star and path is obtained.
Keywords£ºstar£» path£»join graph£»adjacent strong edge chromatic number