International Journal of Engineering, Science and Mathematics

  • Year: 2018
  • Volume: 7
  • Issue: 10

Anti-magic labeling for boolean graph of cycle (Cn)(n≥ 4)

  • Author:
  • T. Subhramaniyan1, K. Manikandan2, S. Suruthi3
  • Total Page Count: 11
  • DOI:
  • Page Number: 1 to 11

1Associate Professor, Department of Mathematics, Guru Nanak College, Chennai, India

2Assistant Professor, Department of Mathematics, Guru Nanak College, Chennai, India

3Assistant Professor, Department of Mathematics, D. B. Jain College, Chennai, India

Online published on 7 May, 2019.

Abstract

A graph G is anti-magic if there is a labeling of its edges with 1, 2, …, |E| such that the sum of the labels assigned to edges incident to distinct vertices are different. A conjecture of Hartsfield and Ringel states that every connected graph different from K2 is anti-magic. Our main result validates this conjecture for Boolean graph of cycle Cn(n ≥ 4) is anti-magic.

Keywords

Boolean graph BG (G), Anti-magic Labeling