摘要
根据路,圈,扇,轮,2-维网格的结构性质,用先确定点的色集合,再染边和点的方法,研究它们的一般邻点可区别全染色,给出与相关文献不同的证明,并讨论了这几类图的正常点色数与一般邻点可区别全色数的关系,在此基础上提出了这五类特殊图的一般邻点可区别全染色的一种算法,并用MATLAB实现.
In this paper, according to the properties of path, circle, wheel, fan, 2 dimensional mesh, the general adjacent vertex-distinguishing total coloring of these graph are studied by coloring edge and vertex after the color sets were been decided, the proof are different from [7]. Base on the relationship of the proper vertex-coloring and the general adjacent vertex- distinguishing total coloring on these graph,an algorithm for the general adjacent vertex- distinguishing total coloring of these graph are presented and Realized on the MATLAB.
出处
《数学的实践与认识》
CSCD
北大核心
2013年第15期227-233,共7页
Mathematics in Practice and Theory
基金
国家自然科学基金(61163037)
陕西省教育厅专项科研项目基金(11JK0508)
2012年汉中市科技计划项目(2-2)
关键词
正常点染色
一般邻点可区别全染色
一般邻点可区别全色数
MATLAB
the proper vertex-coloring
the general adjacent vertex-distinguishing total col-oring
the general adjacent vertex-distinguishing total chromatic number
MATLAB.
