Super edge-magic labeling of volvox and pancyclic graphs

A. Q. Baig, Hafiz U. Afzal, M. Imran, I. Javaid

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

Let G = (V, E) be a finite, simple and undirected graph with vertex set V(G) and edge set E(G), having |V(G)| = p and |E(G)| = q. A (p, q)-graph is edge-magic if there exists a bijective function f : V(G) ∪ E(G)-→ {1,2, ,...,p + q} such that f(u) -f f(uv) + f(v) = t, where t is called the magic constant or sometimes the valence of f for any edge uv ∈ E(G) of the graph G. An edge-magic total labeling f is called super edge-magic total if f(V(G)) = {1,2, .,p}. In this paper, we are dealing with the super edge-magic labeling of volvox and pancyclic graphs.

Original languageEnglish
Pages (from-to)49-56
Number of pages8
JournalUtilitas Mathematica
Volume93
Publication statusPublished - Mar 2014
Externally publishedYes

Keywords

  • Cycle
  • Pancyclic
  • Super edge-magic total
  • Volvox

ASJC Scopus subject areas

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

Fingerprint

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

Cite this