若干联图的邻点可区别I-全染色  

Adjacent Vertex-Distinguishing I-Total Coloring of Some Join Graphs

作　　者：张婷[1] 朱恩强[2] 刘晓娜[3] 赵双柱[3] ZHANG Ting ZHU Enqiang LIU Xiaona ZHAO Shuangzhu(School of Normal, Lanzhou University of Arts and Science, Lanzhou 730000, China School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China School of Digital Media, Lanzhou University of Arts and Science, Lanzhou 730000, China)

机构地区：[1]兰州文理学院师范学院,兰州730000 [2]北京大学信息科学技术学院,北京100871 [3]兰州文理学院数字媒体学院,兰州730000

出　　处：《吉林大学学报（理学版）》2017年第2期267-272,共6页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:60974112);中国博士后科学基金(批准号:2015M580928);甘肃省高等学校科研项目(批准号:2015A-172)

摘　　要：利用函数构造法和数学归纳法,考虑图P_m∨S_n,F_m∨W_n和W_m∨W_n的邻点可区别I-全染色,给出了它们邻点可区别I-全色数.By using the function construction method and mathematical induction,we considered adjacent vertex-distinguishing I-total coloring of graphs P_m ∨S_n,F_m ∨W_n and W_m ∨W_n,and gave the adjacent vertex-distinguishing I-total chromatic number of them.

关 键 词：联图 I-全染色 邻点可区别I-全染色 邻点可区别I-全色数 

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