Odd Gracefulness and Labeling Algorithm of Hybrid Network topology LP(m,n)

In network design, the choice of network topology plays a decisive role in the realization efficiency of computer network communication and data transmission functions, and the label nature of computer network topology directly affects the design of network and communication costs. Only by extensively studying the specific labels of different combined topologies and constructing as many hybrid network topologies with specific labels as possible, can the hybrid network topologies with specific labels be flexibly selected in the network design according to the design requirements, and the computer communication network systems with more complete functions, stronger communication reliability and lower communication costs be designed. It provides theoretical basis and necessary model for the construction of information communication network infrastructure upgrading project, telecom universal service pilot project and network management upgrading project. This paper presents the definition of the hybrid network topology structure LP(m, n), designs the "HYN-OGL-LP(m, n) ALGORITHM", and through theoretical demonstration, proves the correctness of the algorithm, thereby proving the Odd Graceful property of the hybrid network topology structure LP(m, n). The "HYN-OGL-LP(m, n) ALGORITHM" program was compiled using the MATLAB language, and the effectiveness of the algorithm was illustrated through experimental data.