Abstract: | With its comprehensive applicatian in network information engineering (e.g.dynamic spectrum allocation tinder different distance comtraints) and in network combination optimization (e.g.safe storage of deleterious materials),the graphs'cloring theory and chromatic uniqueness theory have been the forward position of graph theory research.The later concerns the equlvaleat classification of graphs with their color polynomials and the determination of uniqueness of some equivalent classification under isomorphism. In this paper,by introducing the concept of chromatic nomality and comparing the manber of partitions of two chromatically equivalent graphs,a general numerical condition guareateeing that bipartite graphs K (m,n)-A (A(∈)E (K(m,n)) and |A|≥2) is chromatically unique was obtained and a lot of chromatic uniquoness graphs of bipartite graphs K (m,n)-A were determined.The results obtained in this paper were general.And the results cover and extend the majority of the relevant results obtained within the world. |