A(p.q)- graph G is edge magic if there exists a one-to-one and onto mapping f: V(G)UE(G) → {1,2, …,p + q} such that f(x) + f(y) + f(xy) = C_f is a constant for any edge by xy ∈ E(G) and if f(E) = {1.2, …,q}, then f is a super magic labeling of G. The super magic strength of a super magic graph G denoted by sms(G) is defined to be minimum of all C_f' where the minimum runs over all the super magic labeling of G. In this paper, we introduced above both the concepts and obtained the super magic labeling and super magic strength of new class of graphs such as B_(m,n),(K_(1,m)?K_(1,n)) and C_n ⊙ mK_1
展开▼
