首页 | 本学科首页   官方微博 | 高级检索  
     

A Note on Adjacent Strong Edge Coloring of K(n,m)
引用本文:Jing-wen Li Zhong-fu Zhang Xiang-en Chen Yi-rong Sun. A Note on Adjacent Strong Edge Coloring of K(n,m)[J]. 应用数学学报(英文版), 2006, 22(2): 273-276. DOI: 10.1007/s10255-006-0303-x
作者姓名:Jing-wen Li Zhong-fu Zhang Xiang-en Chen Yi-rong Sun
作者单位:[1]College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China [2]Institutc of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China [3]College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China
基金项目:Supported by the National Natural Science Foundation of China (No.40301037).
摘    要:In this paper, we prove that the adjacent strong edge chromatic number of a graph K(n,m) is n + 1, with n ≥ 2, m ≥ 1.

关 键 词:边缘色彩 图论 邻近 边界
收稿时间:2004-04-17
修稿时间:2004-04-17

A Note on Adjacent Strong Edge Coloring of K(n,m)
Jing-wen Li,Zhong-fu Zhang,Xiang-en Chen,Yi-rong Sun. A Note on Adjacent Strong Edge Coloring of K(n,m)[J]. Acta Mathematicae Applicatae Sinica, 2006, 22(2): 273-276. DOI: 10.1007/s10255-006-0303-x
Authors:Jing-wen Li  Zhong-fu Zhang  Xiang-en Chen  Yi-rong Sun
Affiliation:(1) College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China;(2) Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China;(3) College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China
Abstract:In this paper,we prove that the adjacent strong edge chromatic number of a graph K(n,m) is n 1,with n(?)2,m(?)1.
Keywords:Coloring   edge coloring   adjacent strong edge coloring
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号