L(2,1)—labeling of the bracelet graph
In order to better study the channel assignment problem, a function from the vertex set to the set of all nonnegative integers is generated, that is the L(2,1)—labeling of a graph. Let the least label be zero, the L(2,1)—labeling number of a graph is the smallest number over the spans of all L(2,1)—...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Hebei University of Science and Technology
2018-08-01
|
| Series: | Journal of Hebei University of Science and Technology |
| Subjects: | |
| Online Access: | http://xuebao.hebust.edu.cn/hbkjdx/ch/reader/create_pdf.aspx?file_no=b201804004&flag=1&journal_ |