Vertex-antimagic total labeling of the union of suns

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Let G = (V, E) be a graph with V(G) as a set of vertices and E(G) as a set of edges, where n = |V(G)| and e = |-E(G)|. A graph G = (V, E) is said to be (a, d)-vertex antimagic total if there exist positive integers a, d and a bijection A from V(G) U E(G) to the set of consecutive integers {1,2,...,n+e] such that the weight of vertices form arithmetical progression with initial term a and common difference d. In this paper we will give (a, d)-vertex antimagic total labeling of disconnected graph, which consists of the union of t suns for d ∈ {1,2,3,4,6}.

Original languageEnglish
Pages (from-to)179-188
Number of pages10
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Publication statusPublished - Nov 2009


  • Sun graph
  • Vertex antimagic total labeling


Dive into the research topics of 'Vertex-antimagic total labeling of the union of suns'. Together they form a unique fingerprint.

Cite this