Antimagic labeled digraphs using some algebraic structures

Antimagic labeling of a digraph D involves assigning unique integers to each of its directed edges in such a way that the sums of labels on incoming edges minus the sums of labels on outgoing edges are all distinct for every vertex in D. This ensures that each vertex in the digraph has a unique sum associated with its incoming and outgoing edges. In this paper, We have employed the principles of hooked Skolem sequences, difference triples of a set, and Balanced Incomplete Block Design (BIBD) characterized by parameters [Formula: see text] to construct antimagic digraphs.