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_ |
| _version_ | 1818290316712607744 |
|---|---|
| author | Haiping LI Ying YANG |
| author_facet | Haiping LI Ying YANG |
| author_sort | Haiping LI |
| collection | DOAJ |
| description | 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)—labeling of this graph. Aiming at the problem of the L(2,1)—labeling numbers of the bracelet graph, which is a generalized graph from Cartesian products of the path and cycles, the definition of the bracelet graph is given, which is obtained by overlapping the two ends of a similarity ladder. At the same time the definition of the L(2,1)—labeling numbers is given. The L(2,1)—labeling number is completely determined by vertex grouped labeling method according to the difference of the circles' numbers and the vertices' numbers of the circles. The types of graphs are enriched and the labeling number theories are perfected. |
| first_indexed | 2024-12-13T02:26:14Z |
| format | Article |
| id | doaj.art-b8f0a78d567b42918901afa34568796c |
| institution | Directory Open Access Journal |
| issn | 1008-1542 |
| language | zho |
| last_indexed | 2024-12-13T02:26:14Z |
| publishDate | 2018-08-01 |
| publisher | Hebei University of Science and Technology |
| record_format | Article |
| series | Journal of Hebei University of Science and Technology |
| spelling | doaj.art-b8f0a78d567b42918901afa34568796c2022-12-22T00:02:38ZzhoHebei University of Science and TechnologyJournal of Hebei University of Science and Technology1008-15422018-08-0139431432010.7535/hbkd.2018yx04004b201804004L(2,1)—labeling of the bracelet graphHaiping LI0Ying YANG1School of Science, Hebei University of Science and Technology, Shijiazhuang, Hebei 050018, ChinaSchool of Science, Hebei University of Science and Technology, Shijiazhuang, Hebei 050018, ChinaIn 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)—labeling of this graph. Aiming at the problem of the L(2,1)—labeling numbers of the bracelet graph, which is a generalized graph from Cartesian products of the path and cycles, the definition of the bracelet graph is given, which is obtained by overlapping the two ends of a similarity ladder. At the same time the definition of the L(2,1)—labeling numbers is given. The L(2,1)—labeling number is completely determined by vertex grouped labeling method according to the difference of the circles' numbers and the vertices' numbers of the circles. The types of graphs are enriched and the labeling number theories are perfected.http://xuebao.hebust.edu.cn/hbkjdx/ch/reader/create_pdf.aspx?file_no=b201804004&flag=1&journal_graph theoryL(21)—labelingL(21)—labeling numbersimilarity ladderbracelet graph |
| spellingShingle | Haiping LI Ying YANG L(2,1)—labeling of the bracelet graph Journal of Hebei University of Science and Technology graph theory L(2 1)—labeling L(2 1)—labeling number similarity ladder bracelet graph |
| title | L(2,1)—labeling of the bracelet graph |
| title_full | L(2,1)—labeling of the bracelet graph |
| title_fullStr | L(2,1)—labeling of the bracelet graph |
| title_full_unstemmed | L(2,1)—labeling of the bracelet graph |
| title_short | L(2,1)—labeling of the bracelet graph |
| title_sort | l 2 1 labeling of the bracelet graph |
| topic | graph theory L(2 1)—labeling L(2 1)—labeling number similarity ladder bracelet graph |
| url | http://xuebao.hebust.edu.cn/hbkjdx/ch/reader/create_pdf.aspx?file_no=b201804004&flag=1&journal_ |
| work_keys_str_mv | AT haipingli l21labelingofthebraceletgraph AT yingyang l21labelingofthebraceletgraph |