Super edge-magic labeling of accordion and bracelet graphs

A. Q. Baig, Hafiz U. Afzal, M. Imran, M. S. Bashir, R. J. Qureshi

Research output: Contribution to journalArticlepeer-review


Let G = (V, E) be a finite, simple and undirected graph with vertex set V(G) and edge set E(G). Graph G is called edge-magic if there exists a bijective function f, f: V(G) ∪ E(G) {1,2,..., |V(G)| + |E(G)|} such that f(u) + f(uv) + f(v) is a constant for each edge uv ϵ E(G). An edge-magic labeling f is called super edge-magic if the vertices are labeled with the smallest possible numbers. In this paper, we are dealing with the super edge-magic labeling of accordion and bracelet graphs.

Original languageEnglish
Pages (from-to)283-297
Number of pages15
JournalUtilitas Mathematica
Publication statusPublished - Mar 2017
Externally publishedYes


  • Accordion graph
  • Bracelet graph
  • Edge-magic labeling
  • Super edge-magic labeling

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics


Dive into the research topics of 'Super edge-magic labeling of accordion and bracelet graphs'. Together they form a unique fingerprint.

Cite this