ENERGY OF BINARY LABELED GRAPHS

Let g be a graph with vertex set v (g) and edge set x(g) and consider the set a = f0; 1g.a mapping l : v (g) ??! a is called binary vertex labeling of g and l(v) is called the label of the vertexv under l. in this paper we introduce a new kind of graph energy for the binary labeled graph, thelabeled graph energy el(g). it depends on the underlying graph g and on its binary labeling, upperand lower bounds for el(g) are established. the labeled energies of a number of well known and muchstudied families of graphs are computed.