On the Upper Bound of the Sum Number of Incomplete Prism
Gao Xiu-lian · Journal of Heze University · 2007
Sum graph labelling can be used as a compressed representation of a graph by computer.A graph G is said to be a sum graph if it is isomorphic to the sum graph of some SN.A graph G is said to be a mod sum graph if it is isomorphic to the sum graph of some S{1,2,……,m-1} if all arithmetic is performed modulo m(≥S+1).The mod sum number ρ(G) of G is the smallest number of isolated vertices which when added to G result in a mod sum graph.Cn×K2 is called prism,it is called incomplete prism when we give a subdivision to Cn of prism.This paper gives a mod sum labelling of incomplete prism,and has proved the upper bound of the sum number of incomplete prism is 4 for all n≥3.