Odd-elegant Labeling Algorithm of Generalized Ring Core Networks
Jianmin Xie, Bing Yao, Wenmei Hong · 2016
In the network design, the choice of the network topology plays a decisive role for the realization of the function of computer network efficiency.The labeling problem of the computer network topology directly affects the network design and communication costs, etc. Generalized ring network topology is a very important hybrid network topology structure, and generalized ring core network is its base.In this paper, based on the requirements of research of generalized ring network addressing, the author designs the GRN-OEL-algorithm when 1 2 , , , 0(mod 4) m n n n ≡ , proves odd-elegant of the generalized ring core network, works out the corresponding software, and tests the practical effectiveness of this algorithm with our experimental data. ,(n is a multiple of 4) [7].In 2009, Barrientons proved the odd-graceful of topology structure of tree with its diameter of no more than five [8].In 2013, Zhou et al. proved the odd-elegant of lobster -----a hybrid topology structure [2].Generalized ring network is a very important hybrid network topology structure, which refers to a number of closed rings formed of nodes linked together point to point and end to end in network and each nodes of rings has a line nodes(we call line nodes leaves).The information both can be translated in a direction between nodes in the loop, and can be translated between ring nodes and leaves.After the leaves of generalized ring network are removed, we call the rests the generalized ring core network.Obviously, generalized ring core network is the basis of generalized ring network.In this paper, based on the requirements of research of generalized ring network addressing, the author designs the GRN-OEL algorithm when 1 2 , , , 0(mod 4) m n n n ≡ , proves odd-elegant of this