摘要
研究了冠图SnPm,PnSm,SnCm和CnSm的邻点可区别I-全染色问题.根据这些冠图的结构特征,构造了一个从集合V(G)∪E(G)到色集合{1,2,…,k}的函数,给出了一种染色方案,得到了它们的邻点可区别的I-全色数.
Adjacent vertex-distinguishing I-total coloring of crown graphs Sn Pm,Pn Sm,Sn Cmand Cn Sm have been studied.By constructing the function fromV（G）∪E（G）to{1,2,…,k},A new coloring method has been given according to the feature of these graphs,and the adjacent vertex-distinguishing I-total chromatic numbers of them have been obtained.
出处
《西南师范大学学报（自然科学版）》
CAS
北大核心
2015年第10期10-13,共4页
Journal of Southwest China Normal University(Natural Science Edition)
基金
山东省自然科学基金项目(ZR2014AM032)
山东省高校科技计划项目(J13LI02)
关键词
邻点可区别全染色
邻点可区别I-全染色
邻点可区别I-全色数
冠图
adjacent vertex-distinguishing total coloring
adjacent vertex-distinguishing I-total coloring
adjacent vertex-distinguishing I-total chromatic number
crown graph
