|
|
- 2018
几类特殊图的Mycielski图的(2, 1)全标号
|
Abstract:
研究了与频道分配有关的一种染色问题：（p，1）-全标号.根据Mycielski图的构造特征，利用穷染法，给出了一种标号方法，得到了路、圈、扇和轮的Mycielski图的（2，1）-全标号数.（p，1）-全标号是对图的全染色的一种推广.
A coloring problem (p, 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 (p, 1)-total labelling of graphs extends the total coloring of graphs
| [1] | BONDY J A, MURTY U S R. Graph Theory with Applications[M]. London: Macmillan Press Ltd, 1976. |
| [2] | HAVET F, YU M L. (p, 1)-Total Labelling of Graphs[J]. Discrete Math, 2008, 308(4): 496-513. DOI:10.1016/j.disc.2007.03.034 |
| [3] | CHANG G J, HUANG L L, ZHU X D. Circular Chromatic Number of Mycielski's Graphs[J]. Discrete Math, 1999, 205(1-3): 23-37. DOI:10.1016/S0012-365X(99)00033-3 |
| [4] | 刘秀丽. 若干Mycielski图的邻点可区别V-全染色[J]. 西南师范大学学报(自然科学版), 2015, 40(12): 12-16. |
| [5] | GRIGGS J R, YEH R K. Labelling Graphs with a Condition at Distance Two[J]. SIAM J Discrete Math, 1992, 5(4): 586-595. DOI:10.1137/0405048 |
| [6] | WHITTLESEY M A, GEORGES J P, MAURO D W. On the λ-Number of Qn and Related Graphs[J]. SIAM J Discrete Mathematics, 1995, 8(4): 499-506. DOI:10.1137/S0895480192242821 |
| [7] | LIU H M. Circular Chromatic Number for Mycielski Graphs[J]. J of Math (PRC), 2006, 26(3): 255-260. |
| [8] | CHEN D, WANG W F. (2, 1)-Total Labelling of Outerplanar Graphs[J]. Discrete Applied Math, 2007, 155(18): 2585-2593. DOI:10.1016/j.dam.2007.07.016 |
| [9] | CHEN X E, ZHANG Z F, YAN J Z, et al. Adjacent-Vertex-Distinguishing Total Chromatic Numbers on Mycielski's Graphs of Several Kinds of Particular Graphs[J]. Jorunal of Lanzhou University (Natural Science), 2005, 41(2): 117-122. |
| [10] | BOLLOBAS B. Modern Graph Theory[M]. New York: Spring-Verlag, 1998. |
