%0 Journal Article
%T THE GENERAL NEIGHBOR-DISTINGUISHING TOTAL COLORING OF GRAPHS<br>关于图的一般邻点可区别全染色
%A YAN Qiantai
%A <br>严谦泰
%J 系统科学与数学
%D 2010
%I 
%X In this paper, a new notion is proposed that is the general neighbor-istinguishing total coloring. The general neighbor-distinguishing total coloring chromatic index of the paths $P_n$, cycles $C_n$, stars $S_n$, fans $F_n$wheel graphs $W_n$, bipartite graphs $G\langle V_1,V_2,E\rangle$, trees $T_n$ and complete graphs $K_n$ are given.
%K General neighbor-distinguishing edge coloring
%K general neighbor-distinguishing total coloring
%K general neighbor-distinguishing total coloring chromatic index<br>一般邻点可区别边染色
%K 一般邻点可区别全染色
%K 一般邻点可区别全染色指标.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=3AAE34C8E988AD4716805810AB5DE6A4&yid=140ECF96957D60B2&vid=340AC2BF8E7AB4FD&iid=CA4FD0336C81A37A&sid=74011071555EB4E5&eid=F24949CFDB502409&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=9