摘要
讨论了弱积图邻点可区别一般边染色,给出了P_(2n)×K_m,C_(2n)×C_(2m),C_(2n+1)×C_(2m+1),C_(2n+1)×K_m的邻点可区别一般边色数,得到了当G和H都无孤立边且色数均至少为3时,G×H邻点可区别一般边色数至少为3的结论.
The general neighbor-distinguishing edge colorings of weak products of two graphs were discussed and the generM neighbor-distinguishing indices of P2n×Km,C2n×C2m,C2n＋1×C2m＋1,C2n＋1×km were given, with the conclusion that the general neighbor-distinguishing index is at least 3 if G and H has no isolated edges and that the chromatic number is at least 3.
出处
《兰州大学学报（自然科学版）》
CAS
CSCD
北大核心
2012年第1期97-99,103,共4页
Journal of Lanzhou University(Natural Sciences)
基金
国家自然科学基金项目(61163037
61163054)
宁夏回族自治区自然科学基金项目(NZ1154)
宁夏大学科学研究基金项目((E):ndzr10-7)
西北师范大学"知识与科技创新工程"项目(NWNU-KJCXGC-03-61)
关键词
弱积图
邻点可区别一般边染色
邻点可区别一般边色数
weak product graph
general neighbor-distinguishing edge coloring
general neighbor-distinguishingindex
