ANTIMAGIC LABELING OF DIGRAPHS

Nalliah Moviri

Abstract


AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of all arcs entering that vertex minus the sum of the labels of all arcs leaving it. A digraph D is called antimagic if it admits an antimagic labeling. In this paper we investigate the existence of antimagic labelings of some few families of digraphs using hooked Skolem sequences.DOI : http://dx.doi.org/10.22342/jims.22.1.216.61-69

Keywords


antimagic labeling;hooked Skolem sequence;graphdigraph

Full Text:

PDF


DOI: https://doi.org/10.22342/jims.22.1.216.61-69

Refbacks

  • There are currently no refbacks.



Journal of the Indonesian Mathematical Society
Mathematics Department, Universitas Gadjah Mada
Senolowo, Sinduadi, Mlati, Sleman Regency, Special Region of Yogyakarta 55281, Telp. (0274) 552243
Email: jims.indoms@gmail.com


p-ISSN: 2086-8952 | e-ISSN: 2460-0245


Journal of the Indonesian Mathematical Society is licensed under a Creative Commons Attribution 4.0 International License

web statistics
View My Stats