山西大学学报（自然科学版）2012，Vol.35Issue(4)：641-647,7.
两类3-正则图的邻点可区别I-全染色
Adjacent Vertex-distinguishing I-total Coloring of Two Kinds of 3-regular Graphs
摘要
Abstract
The I-total coloring of a graphs G is an assignment of some colors to its vertices and edges such that no two adjacent vertices receive the dame color and no two adjacent edges receive the same color. Under the I-total coloring of G，the color set of a vertex x of G is the set of all colors which are assigned to vertex x or the edges incident to x. An I-total coloring is called adjacent vertex distinguishing if any two adjacent vertices have different color sets. The minimum number of colors required in an adjacent vertex-distinguishing I-total coloring is called adjacent vertex-distinguishing I-total chromatic number. The adjacent vertex-distinguishing I-total coloring of two kind of 3-regular graphs are discussed.关键词
I-全染色/邻点可区别I-全染色/邻点可区别I-全色数Key words
I-total coloring/ adjacent vertex-distinguishing I-total coloring/ adjacent vertexdistinguishing I-total chromatic number分类
数理科学引用本文复制引用
杨随义,杨晓亚,唐保祥,何万生..两类3-正则图的邻点可区别I-全染色[J].山西大学学报（自然科学版）,2012,35(4):641-647,7.基金项目
甘肃省自然科学基金(096RJZE106) （096RJZE106）
天水师范学院中青年教师科研资助项目(TSA1102) （TSA1102）
