Research on L(2,1)-edge Labelling Algorithm of Graph
Lina Zhu, Jingwen Li, Shuai Sun, Qiaojun Zhang · 2021 IEEE 5th Information Technology,Networking,Electronic and Automation Control Conference (ITNEC) · 2021
The distance label problem of the graph is a graph model of the frequency allocation problem. The frequency allocation problem means that different stations in a certain area use radio waves to send signals. In order to avoid interference, stations located close to each other need to use different channels. When the distance between stations is very close, they need to be separated by at least 2 channels. L (2,1)-edge label means that the label number difference of two sides with a distance of 1 is greater than or equal to 2, and the label numbers of two sides with a distance greater than 1 are different. This paper designs an L (2,1)-edge label algorithm for random graphs. Experimental results show that this algorithm can solve the L (2,1)-edge label problem of random graphs within finite points. Through the analysis of the experimental results, the labeling characteristics of the four types of graphs are found, and T, Kp\ e, Fn∇S1and F2∇Fnare defined to characterize these four types of graphs, and related theorems and their proofs are given.