Label's Mechanization For A Kind Of Special Network Models And Its Application

The definition and properties of a kind of special network models-pseudo-complete bipartite graph P Kn,n were given in this paper.We proposed odd graceful labeling algorithm of the graphs of its kind and the correctness of the algorithm and the complexity of time,The experimental data prove the odd gracefulness of the pseudo-complete bipartite graph PKn,n as n = 3,4,5.We give all odd graceful labelings when the number of vertices is small by using computer programs.In addition,we gave a specific labeling method of pseudo-complete bipartite graph as n = 3,4,5.We proved that the special network models is not graceful as n =2 and n = 4m-1,m?Z+,and verified a related conjecture.we proposed graceful labeling algorithm of PKn,n and the correctness of the algorithm and the complexity of time.The experimental data prove the gracefulness of the pseudo-complete bipartite graph PKn,n as n = 4.And then study the application of such special network model in network information security and so on.