New results on super edge magic deficiency of kite graphs

An edge magic labeling of a graph G is a bijection λ: V (G) ∪E(G) → (((1, 2, ... , |V(G)|+|E(G)|))) such that λ(u)+λ(uv)+λ(v) is constant, for every edge uv ∈ E(G). The concept of edge magic deficiency was introduce by Kotzig and Rosas. Motivated by this concept Figueroa-Centeno, Ichishima and Muntaner-Batle defined a similar concept for super edge magic total labelings. The super edge magic deficiency of a graph G, which is denoted by μ_s(G), is the minimum nonnegative integer n such that G∪nK₁, has a super edge magic total labeling or it is equal to +∞ if there exists no such n. In this paper, we study the super edge magic deficiency of kite graphs.