The Wireless Sensor Networks Based on Adjacent Strong Edge Chromatic Number

The adjacent strong edge chromatic number of graphs can be applied to the optimization design of wireless sensor network to make the network design more reasonable. An algorithm,based on the basic principle of page sorting technology, is designed to search for the adjacent strong edge coloring of certain join graphs. Therefore, the adjacent strong edge chromatic number of a join graph is obtained, and it can avoid the repetition of wireless sensor network.

On the Equitable Adjacent Strong Edge Coloring of K(n,m)

For a graph G(V,E),then is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC, if a k-ASEC of G satisfies then f is called k-equitable adjacent strong edge coloring of G, is called k-EASC for short, and is called the equitable adjacent strong edge chromatic number of G. In this paper, we have proved the equitable adjacent strong edge chromatic number of graph K(n,m) , with n≥ 2,n≡0(mod 2), m≥ 1.