笛卡尔积图的集合边色数  

The set edge chromatic number of cartesian product of graphs

作　　者：王艳丽[1] 万慧敏[1] 

机构地区：[1]中国矿业大学理学院,徐州221116

出　　处：《黑龙江大学自然科学学报》2013年第4期471-473,共3页Journal of Natural Science of Heilongjiang University

基　　金：中央高校基本科研业务费专项资金资助项目(2010LKSX06);国家自然科学基金资助项目(61104111)

摘　　要：运用分析的方法,证明路与路的笛卡尔积图和路与圈的笛卡尔积图的集合边色数都是4,路与扇的笛卡尔积图的集合边色数等于图的最大度,同时提出一个猜想:任意图的笛卡尔积图的集合边色数都等于它的最大度。By the use of the method of analysis, it is shown that the set edge chromatic number of cartesian product of graphs of path and path is four, the set edge chromatic number of cartesian product of graphs of path and cycle is four, and the set edge chromatic number of cartesian product of graphs of path and fan is the maximum degree. Furthermore, a conjecture that the set edge chromatic number of every cartesian product of graphs＇ are maximum degree is also put forward.

关 键 词：集合边色数 笛卡尔积 路 圈 扇 

分 类 号：O157.5[理学—数学]