Vertex magic total labelings of 2-regular graphs

Sylwia Cichacz, Dalibor Froncek, Inne Singgih

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

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 λ : V ∪ E → { 1, 2, …, | V | + | E | } so that for every x ∈ V, w ( x ) = λ ( x ) + ∑ x y ∈ E λ ( x y ) = k, for some integer k. A VMT labeling is said to be a super VMT labeling if the vertices are labeled with the smallest possible integers, 1, 2, …, | V |. In this paper we introduce a new method to expand some known VMT labelings of 2-regular graphs.

Original languageEnglish (US)
Pages (from-to)3117-3124
Number of pages8
JournalDiscrete Mathematics
Volume340
Issue number1
DOIs
StatePublished - Jan 6 2017

Bibliographical note

Publisher Copyright:
© 2016 Elsevier Ltd

Keywords

  • Magic-type labelings
  • Vertex magic total labelings

Fingerprint

Dive into the research topics of 'Vertex magic total labelings of 2-regular graphs'. Together they form a unique fingerprint.

Cite this