Theory and Applications of Graphs, cilt.12, sa.1, ss.1-8, 2025 (Scopus)
A simple graph G with vertex set V (G) and edge set E(G) is Zk-antimagic if there exists a function f : E(G) → Zk\{0} such that the induced function f +(v) = P uv∈E(G) f(uv) is injective. The integer-antimagic spectrum of a graph G is the set IAM(G) = {k : G is Zk-antimagic and k ≥ 2}. A weak join of vertex-disjoint graphs is the collection of the graphs with additional simple edges between the original graphs. In this paper, we characterize IAM(H) where H is a weak join of Hamiltonian graphs.