%0 Journal Article
%T 几类特殊图的Mycielski图的(2, 1)全标号<br>(2, 1)-Total Labelling on Mycielski's Graphs of Several Kinds of Particular Graphs
%A 刘秀丽
%J 西南大学学报(自然科学版)
%D 2018
%R 10.13718/j.cnki.xdzk.2018.12.016
%X 研究了与频道分配有关的一种染色问题：（<i>p</i>，1）-全标号.根据Mycielski图的构造特征，利用穷染法，给出了一种标号方法，得到了路、圈、扇和轮的Mycielski图的（2，1）-全标号数.（<i>p</i>，1）-全标号是对图的全染色的一种推广.<br>A coloring problem (<i>p</i>, 1)-total labelling of some graphs, which is related to frequency assignment, is studied. By using the eternal coloring method, a new labelling method is given according to the feature of Mycielski's graphs, and the (2, 1)-total numbers of path, cycle, fan and wheel of the graphs are obtained. And the (<i>p</i>, 1)-total labelling of graphs extends the total coloring of graphs
%K 染色
%K (&lt
%K i&gt
%K p&lt
%K /i&gt
%K 1)-全标号
%K (&lt
%K i&gt
%K p&lt
%K /i&gt
%K 1)-全标号数
%K Mycielski图&lt
%K br&gt
%K coloring
%K (&lt
%K i&gt
%K p&lt
%K /i&gt
%K 1)-total coloring
%K (&lt
%K i&gt
%K p&lt
%K /i&gt
%K 1)-total number
%K Mycielski's graph
%U http://xbgjxt.swu.edu.cn/jsuns/html/jsuns/2018/12/20181216.htm