Super magic deficiency of graphs

An edge-magic total (EMT) labeling for graph Gamma is one-one map from pi : V(Gamma) boolean OR E(Gamma) -> {1, 2,..., vertical bar V(Gamma)vertical bar+vertical bar E(Gamma)vertical bar}, so that there manage a number c along a rule that for every edge, uv is an element of E(Gamma), pi (u) + pi (uv) + pi (v) = c. And if all vertices are assigned with positive integral numbers {1, 2,...,vertical bar V(Gamma)vertical bar} then this type of labeling is called a super EMT labeling. Super edge-magic, deficiency for graph Gamma, represented as mu(s) (Gamma), which is least positive integral number n so that Gamma boolean OR nK(1) has super EMT labeling, or infinity, if there does not exist n. In present article, compute a super edge-magic deficiency for the graph sb(l,l,...,l)/n-times.