A vertex magic total labeling is a bijection from the union of the vertex set and edge set to the consecutive integers 1,2,3,....,v+e with the property that for every u in the vertex set, the sum of the label of u and the label of the edges incident with u is equal to k, for some constant k. In this paper, we establish the vertex magic labeling of some classes of graphs and provide some open problems related to it.
Birincil Dil | İngilizce |
---|---|
Bölüm | Makaleler |
Yazarlar | |
Yayımlanma Tarihi | 1 Ağustos 2019 |
Gönderilme Tarihi | 5 Şubat 2018 |
Kabul Tarihi | 25 Haziran 2018 |
Yayımlandığı Sayı | Yıl 2019 Cilt: 68 Sayı: 2 |
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics.
This work is licensed under a Creative Commons Attribution 4.0 International License.