中北大学学报（自然科学版）2016，Vol.37Issue(5)：461-464,469,5.DOI:10.3969/j.issn.1673-3193.2016.05.005
若干路的冠图的邻点可区别I-全染色
Adj acent Vertex-Distinguishing I-Total Coloring of Some Crown Graphs of Path
摘要
Abstract
Adjacent vertex-distinguishing I-total coloring of some crown graphs of path Pn■Pm,Pn■Cm, Pn■Fm and Pn■Wm were studied.Adj acent vertex-distinguishing I-total coloring of G was an assignment f from the vertices and edges setV(G)∪E(G)to the color set {1,2,…,k},such that:f(u)≠f(v)for any uv∈E(G),u≠v;f(uv)≠f(uw)for any uv,uw∈E(G),v≠w;C(u)≠C(v)for any uv∈E(G), u≠v,and C(u)={f(u)}∪{f(uv)|uv∈E(G).The minimum of k was called the adj acent vertex-distin-guishing I-total chromatic number and denoted byχiat (G).By constructing the function from V(G)∪E(G)to {1,2,…,k},a new coloring method was given according to the feature of these graphs,and the adj acent vertex-distinguishing I-total chromatic numbers are obtained.关键词
全染色/邻点可区别全染色/邻点可区别I-全染色/邻点可区别I-全色数/冠图Key words
total coloring/adj acent vertex-distinguishing total coloring/adj acent vertex-distinguishing I-total coloring/adj acent vertex-distinguishing I-total chromatic number/crown graph分类
数理科学引用本文复制引用
刘秀丽..若干路的冠图的邻点可区别I-全染色[J].中北大学学报（自然科学版）,2016,37(5):461-464,469,5.基金项目
山东省自然科学基金资助项目(ZR2014AM032) （ZR2014AM032）
山东省高校科技计划资助项目(J13LI02) （J13LI02）
