Vertex-magic total labelings of union of generalized Petersen graphs and union of special circulant graphs

Denny Riama Silaban, Andrea Parestu, Bong N. Herawati, Kiki Ariyanti, Slamin

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

Let G be a graph with vertex set V = V(G) and edge set E = E(G), and let n = \V(G)\ and e = \E(G)\. A vertex-magic total labeling (VMTL) of a graph is defined as a one-to-one mapping taking the vertices and edges onto the set of integers {1,2,..., n + e}, with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. In this paper, we present the vertex magic total labeling of disjoint union of t generalized Petersen graphs Uj=1 tP(nj,mj), and disjoint union of t special circulant graphs Uj=1 tCn(1,mj).

Original languageEnglish
Pages (from-to)201-207
Number of pages7
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume71
Publication statusPublished - 1 Nov 2009

Keywords

  • Circulant graph
  • Generalized petersen graph
  • Regular graph
  • Vertex magic total labeling

Fingerprint

Dive into the research topics of 'Vertex-magic total labelings of union of generalized Petersen graphs and union of special circulant graphs'. Together they form a unique fingerprint.

Cite this