Study on Compressed Representation of Graph

Abstract:

Image compression for image storage and transmission are very necessary. In order tomore save memory space and more be used as a compressed representation of a image, a image ismapped into a graph, we can use the labeling of graph to compress and give a new graphs compressedrepresentation.

• Periodical: Applied Mechanics and Materials (Volumes 333-335)
• Pages: 868-871
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.333-335.868
• Online since: July 2013
• Authors: Hai Tang Wang
• Keywords: Graph, Image Compression, Labeling, MAGE

References

[1] F. Harary, Sum graphs over all the integers, Discrete Math. 124 (1994) 99–105.

DOI: 10.1016/0012-365x(92)00054-u

[2] W. He, Y. Shen, L. Wang, Y. Chang, Q. Kang, X. Yu, The integral sum number of complete bipartite graphs Kr,s, Discrete Math. 239(2001) 137–146.

DOI: 10.1016/s0012-365x(00)00172-2

[3] A.V. Pyatkin, New formula for the sum number for the complete bipartite graphs, Discrete Math. 239(2001) 155–160.

DOI: 10.1016/s0012-365x(01)00188-1

[4] W. He, X. Yu, H. Mi, Y. Xu, Y. Sheng, L. Wang, The (integral) sum number of Kn -E(Kr), Discrete Math. 243(2002) 241–252.

DOI: 10.1016/s0012-365x(01)00218-7

[5] S. Liaw, D. Kuo, G.J. Chang, Integral sum numbers of graphs, Ars Combinatoria 54(2000) 259–268.

[6] L.S. Melnikov, A.V. Pyatkin, Regular integral sum graphs, Discrete Math. 252(2002) 237–245.

DOI: 10.1016/s0012-365x(01)00426-5

[7] M. Miller, J. Ryan, Slamin, K. Sugeng and M. Tuga, Exclusive sum graph labeling, preprint (2003).