Keywords (Extracted from title, table of contents and
abstract of thesis) Deficiency, Mapping, Super,
Elements, Equal, Forests, Edge, Smallest, Vertices 
Abstract A labeling of a
graph is a mapping that carries some set of graph elements(vertices,
edges or both) into numbers (usually positive integers). An
edgemagic total labeling of a graph with p vertices and q edges is
a onetoone mapping that takes the vertices and edges onto the
integers 1; 2; : : : ; p + q, so that the sums of the label on the
edges and the labels of their end vertices are always the same, thus
they are independent any particular edge. Such a labeling is called
super if the p smallest possible labels appear at the vertices. In
1970 Kotzig and Rosa [33] introduced the concept of edgemagic de
ciency of a graph G, denoted by (G), which is the minimum
nonnegative integer n such that G[nK1 is edgemagic total. Motivated
by Kotzig and Rosa's concept of edgemagic de ciency, FigueroaCenteno,
Ichishima and MuntanerBatle [17] de ned a similar concept for super
edgemagic total labelings. The super edgemagic de ciency of a
graph G, which is denoted by s(G), is the minimum nonnegative
integer n such that G [ nK1 has a super edgemagic total labeling or
it is equal to 1 if there exists no such n.
The thesis is devoted to study of super edgemagic de ciency of
forests.We present new results on the super edgemagic de ciencies
of forests including union of paths, stars, comb, banana trees and
subdivisions of K1;3. In the thesis we also deal with the super
edgemagic de ciencies of forests formed by a disjoint union of
stars.
