The Wireless Sensor Networks Based on Adjacent Strong Edge Chromatic Number

Abstract:

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.

• Periodical: Advanced Materials Research (Volume 981)
• Pages: 474-477
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.981.474
• Online since: July 2014
• Authors: Zong Jian Sun*, Jing Chen
• Keywords: Adjacent Strong Edge Chromatic Number, Join Graph, Link Similarity, Optimization, Wireless Sensor Network (WSN)

References

[1] Burris A. C. and R. H. Schelp. Vertex-distinguishing proper edge-colorings, Journal of graph theory, Vol. 6, No. 2(1997), pp.73-82.

DOI: 10.1002/(sici)1097-0118(199710)26:2<73::aid-jgt2>3.0.co;2-c

[2] Zhang Z. F., Li J. W., Chen X. E., Cheng H., and B. Yao. -vertex-distinguishing proper edge-coloring of graphs, Acta mathematica sinica, Vol. 9, No. 3(2006), pp.703-708.

[3] Bazgan C., Harkat Benhamdine A., and H. Li. On the vertex-distinguishing proper edge-colorings of graphs, Journal of combine theory ser B, Vol. 75, No. 2(1999), pp.288-301.

DOI: 10.1006/jctb.1998.1884

[4] Hornakm, Stakr. The fifth jump of the point-distinguishing chromatic index of, Arsbin, Vol. 42(1996), p, 233-242.

[5] Hornakm, Sotakr. Localization of jumps of the point- dstinguishing chromatic index of , Discuss. Math. graph theory, Vol. 17, No. 2(1997), p, 243-251.

DOI: 10.7151/dmgt.1051

[6] Hornakm, Zagagliasn. On the point-distinguishing romatic index of complete bipartite graph, Ars Combin., Vol. 80(2006), p, 75-85.

[7] Zagagliasn. On the point-distinguishing chromatic index of , Ars Combin., Vol. 25, B, p, 93-104, (1998).

[8] Zagagliasn. On the value of the point-distinguishing chromatic index of , Ars Combin, Vol. 29(1990), pp.235-244.

[9] Zhang Z. F., Liu L. Z. and J. F. Wang. Adjacent strong edge coloring of graphs, Applied mathematics letters, No. 5(2002), pp.23-626.

DOI: 10.1016/s0893-9659(02)80015-5

[10] Bondy J. A. and U. S. R. Murty. Graph theory with application, The Macmillan Press, New York, (1976).

[11] Tian S. L., Li J. W. and Z. F. Zhang. On the adjacent strong edge chromatic number of, Journal of Shandong university, Vol. 40, No. 1(2005), pp.7-10.

[12] Sun Z. J., Li Z. C., Luo H. P. and J.D. He, Gracefullness of up-down ladder graphers, Application research of computers, Vol. 24, No. 12(2007), pp.132-133.