Contents

On Antimagic Labelings of Disjoint Union of Complete \(s\)-Partite Graphs

Dafik 1, Mirka Miller2, Joe Ryan3, Martin Baéa4
1School of Information Technology and Mathematical Sciences University of Ballarat, Australia
2Department. of Mathematics Education Universitas Jember, Indonesia
3Department of Mathematics University of West Bohemia, Plzcii, Czech Republic Department of Appl. Mathematics
4Technical University, Kosice, Slovak Republic

Abstract

By an \((a, d)\)-edge-antimagic total labeling of a graph \( G(V, E) \), we mean a bijective function \( f \) from \( V(G) \cup E(G) \) onto the set \( \{1, 2, \dots, |V(G)| + |E(G)|\} \) such that the set of all the edge-weights, \( w(uv) = f(u) + f(uv) + f(v) \), for \( uv \in E(G) \), is \( \{a, a+d, a+2d, \dots, a + (|E(G)| – 1)d\} \), for two integers \( a > 0 \) and \( d \geq 0 \).

In this paper, we study the edge-antimagic properties for the disjoint union of complete \( s \)-partite graphs.

Keywords: complete s-partite graph, (a, d)-edge-antimagic total la- beling, super (a, d)-edge-antimagic total labeling.