An Algorithm for the General Adjacent Vertex-distinguishing Total Coloring of Some Graph and Realization on the MATLAB

Tian Jing-jin · Shuxue de shijian yu renshi · 2013

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 vertexdistinguishing total coloring on these graph.an algorithm for the general adjacent vertexdistinguishing total coloring of these graph are presented and Realized on the MATLAB.

Read the paper · More papers on PaperTik