Research On The Sum Numbers And The Integral Sum Numbers Of The Graph

The data storage of the graph in the computer is based on its labeling. From apractical standpoint, the sum graph and the integral sum graph are the ways used asthe compressed representations of the graph, that is, the topological data structure ofthe graph. The Data compression not only saves the memory, but also speeds up theprocess.The concepts and their open problems of the sum graph and the integral sumgraph were introduced one after another by Frank Harary in1994, and started toresearch on them. The research results are applied deeply in Data Storage, AlgorithmSpeed, Password Theory, Exchange Network Theory, Cyclic Design etc.In this paper, we mainly determine the sum number and the integral sum numberof the graph K n\E(Cn1)and K n\E(Pn1)for any n4.