A New Graph Compression in Information Storage

Abstract:

In the information storage, the image is often encountered, but the image storage and analysis are very complex, in order to more save memory space and more be used as a compressed representation of a graph, we give a new definition in the paper. We show some properties and give the lower integral sum number of some graph.

• Periodical: Applied Mechanics and Materials (Volumes 263-266)
• Pages: 2465-2468
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.263-266.2465
• Online since: December 2012
• Authors: Hai Tang Wang, Zhao Hui Xing, Min Li
• Keywords: Graph, Image Compression, Information Processing, Labeling

References

[1] Feng Jih-Ming,Hsu Taoi,Kuo Jiann-Ling.Texture analysis based on affine transform coding, Image Process-ing 1999. .

DOI: 10.1109/icip.1999.821585

[2] Ingrid Daubechies,Wim Sweldens.  Factoring wavelet transforms into lifting steps[J] ,(1998)

DOI: 10.1007/bfb0011095

[3] W. He, X. Yu, H. Mi, Y. Xu, Y. Sheng, L. Wang, The (integral) sum number of Discrete Math. 2002, pp.241-252

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

[4] S. Liaw, D. Kuo, G.J. Chang, Integral sum numbers of graphs, Ars Combinatoria. 2000,pp.259-268.

[5] L.S. Melnikov, A.V. Pyatkin, Regular integral sum graphs, Discrete Math. 2002,pp.237-245.

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

[6] M. Sutton, M. Miller, On the sum number of wheels, Discrete Math. 2001, pp.185-188

[7] Li Min, Gao Jingzhen, Some results on lower integral sum graph, Journal of Shandong Normal University (Natural Science) 2006, pp.23-25.