Abstract

A graph with labeling of its vertices using distinct non - negative integers such that the sum of the labels of any two vertices which are adjacent is also a label of a vertex in that graph. The even sum number of $G,$ denoted by $\gamma (G)$ defined as the number of isolated vertices needed to make a graph, an even sum graph. and that number should be the mininimum. In this article, we enquires on various ESG.

Keywords and Phrases

Comb, crown, complete graph, complete bipartite graph, wheel.

A.M.S. subject classification

05C05, 05C70, 05C75, 05C78.

.....