Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 504251, 4 pages
Research Article

Tree-Antimagicness of Disconnected Graphs

1Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, Slovakia
2Abdus Salam International Center of Mathematics, Information Technology University, Lahore, Pakistan

Received 10 October 2014; Accepted 5 January 2015

Academic Editor: Qing-Wen Wang

Copyright © 2015 Martin Bača et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


A simple graph admits an -covering if every edge in belongs to a subgraph of isomorphic to . The graph is said to be (, )--antimagic if there exists a bijection from the vertex set and the edge set onto the set of integers such that, for all subgraphs of isomorphic to , the sum of labels of all vertices and edges belonging to constitute the arithmetic progression with the initial term and the common difference . is said to be a super (, )--antimagic if the smallest possible labels appear on the vertices. In this paper, we study super tree-antimagic total labelings of disjoint union of graphs.