Tree-Antimagicness of Disconnected Graphs

Martin Bača, Zuzana Kimáková, Andrea Semaničová-Feňovčíková and Muhammad Awais Umar

Mathematical Problems in Engineering, 2015, vol. 2015, 1-4

Abstract:

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/504251.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/504251.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:504251

DOI: 10.1155/2015/504251

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().