Vertex magic total labelings of 2-regular graphs

被引：11

作者：

Cichacz, Syiwia ^{[1
,2
]}

Froncek, Dalibor ^{[1
]}

Singgih, Inne ^{[1
,3
]}

机构：

[1] Univ Minnesota Duluth, Duluth, MN 55812 USA

[2] AGH Univ Sci & Technol, Krakow, Poland

[3] Univ South Carolina, Columbia, SC 29208 USA

来源：

DISCRETE MATHEMATICS | 2017年 / 340卷 / 01期

关键词：

Magic-type labelings; Vertex magic total labelings;

D O I：

10.1016/j.disc.2016.06.022

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A vertex magic total (VMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to the set of integers defined by lambda : VUE -> {1, 2, ... , vertical bar V vertical bar + vertical bar E vertical bar} so that for every x is an element of V, w(x) = lambda(x)+Sigma(xy is an element of E)lambda(xy) = k, for some integer k. A VMT labelingis said to be a super VMT labeling if the vertices are labeled with the smallest possible integers, 1, 2, ... , vertical bar V vertical bar. In this paper we introduce a new method to expand some known VMT labelings of 2-regular graphs. (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：3117 / 3124

页数：8