New results on super edge magic deficiency of kite graphs

Muhammad Imran, Saima Sami Khan, Sarfraz Ahmad, Muhammad Faisal Nadeem, Muhammad Kamran Siddiqui

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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∪nK1, 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.

Original languageEnglish
Pages (from-to)969-980
Number of pages12
JournalInternational Journal of Applied Mathematics
Issue number6
Publication statusPublished - 2019


  • Cycle
  • Edge magic labeling
  • Kite graphs
  • Path
  • Super edge magic deficiency
  • Super edge magic labeling

ASJC Scopus subject areas

  • General Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'New results on super edge magic deficiency of kite graphs'. Together they form a unique fingerprint.

Cite this