Results on super edge magic deficiency of somewell-known classes of finite graphs

A graph Ω(Λ, Γ) is considered super edge magic if there exists a bijective function ϕ:Λ(Ω)∪Γ(Ω)→ {1, 2, 3, …,|Λ(Ω)|+|Γ(Ω)|} such that ϕ(τ1)+(τ1τ2)+ ϕ(τ2) is a constant for every edge τ1τ2 ∈ Γ(Ω), and ϕ(Λ(Ω))= {1, 2, 3, …,|Λ(Ω)|}. Furthermore, the super edge magic deficiency of a graph Ω, denoted as μs (Ω), is either the minimum non-negative integer η such that Ω∪ηK1 is a super edge magic graph or +∞ if such an integer η does not exist. In this paper, we investigate the super edge magic deficiency of certain families of graphs.