Edge antimagic total labeling on paths and unicycles

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Let G = (V, E) be a simple and undirected graph with v vertices and e edges. An (a, d)-edge-antimagic total labeling is a bijection f from V(G) U E(G) to the set of consecutive integers {11, 2,..., v + e } such that the weight of edges form arithmetical progression with initial term a and common difference d. A super (a, d)-edge antimagic total labelingis an edge antimagic total labeling f which f(V(G)) = { 1, ..., v }. In this paper we solve some problems on edge antimagic total labeling, such as on paths and unicyclic graphs.

Original languageEnglish
Pages (from-to)127-132
Number of pages6
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume65
Publication statusPublished - 1 May 2008

Keywords

  • Edge antimagic total labeling
  • Super edge antimagic total labeling

Fingerprint

Dive into the research topics of 'Edge antimagic total labeling on paths and unicycles'. Together they form a unique fingerprint.

Cite this