Super antimagic total labeling of graphs

Kiki Ariyanti, Mirka Miller, Martin Bača

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labeling is a mapping from elements of a graph to a set of numbers (usually positive integers). If the domain of the mapping is the set of vertices (or edges) then the labeling is called vertex-labeling (or edge-labeling). If the domain of the mapping is the set of vertices and edges then the labeling is called total labeling. The sum of all labels associated with a graph element is called the weight of the element. If the weights of vertices (or the weights of edges) form an arithmetic progression starting at a and with difference d, then the labeling is called (a, d)-vertex-antimagic (or (a, d)-edge-antimagic). Such a labeling is called v-super (or e-super) if the smallest labels appear on the vertices (or edges). In this paper we present new results for v-super vertex-antimagic total and e-super edge-antimagic total labeling.

Original languageEnglish
Pages (from-to)161-171
Number of pages11
JournalUtilitas Mathematica
Publication statusPublished - 1 Jul 2008

Fingerprint Dive into the research topics of 'Super antimagic total labeling of graphs'. Together they form a unique fingerprint.

Cite this