吉林大学学报（理学版）Issue(1)：49-53,5.DOI:10.13413/j.cnki.jdxblxb.2015.01.11
图合成的邻点可区别 E-全染色
Adjacent Vertex Distinguishing E-Total Coloring of Compositions of Graphs
摘要
Abstract
With the method of combinational analysis and the method of constructing concrete coloring,the adjacent vertex distinguishing E-total colorings of compositions of two graphs that satisfying several conditions were discussed,and adjacent vertex distinguishing E-total chromatic numbers for compositions of paths,cycles,fans and wheels were obtained.关键词
图合成/邻点可区别 E-全染色/邻点可区别 E-全色数/色数Key words
composition of graph/adjacent vertex distinguishing E-total coloring/adjacent vertex distinguishing E-total chromatic number/chromatic number分类
数理科学引用本文复制引用
刘信生,邓卫东,陈祥恩,姚兵..图合成的邻点可区别 E-全染色[J].吉林大学学报（理学版）,2015,(1):49-53,5.基金项目
国家自然科学基金(批准号:61163037 （）
61163054 （）
61363060) （）
