Weight of a graph

A total labeling of a graph G(V;E) with n vertices and e edges is a bijection of the function. In this paper we introduce the concept of weight of a graph associated with a total labeling and find the lower and upper bounds for the same for an arbitrary graph. The concept of weight magic-graph is also introduced.