Journals Information
Mathematics and Statistics Vol. 13(2), pp. 105 - 109
DOI: 10.13189/ms.2025.130205
Reprint (PDF) (253Kb)
Antimagic Labeling of Digraphs
Ancy Dsouza 1, Saumya Y M 2, Kumudakshi 3,*
1 Research Scholar, Visvesvaraya Technological University, Belagavi, Karnataka-590018
2 Department of CSE, St Joseph Engineering College, Vamanjoor, Mangaluru-575028
3 Department of Mathematics, NITTE (Deemed to be University), NMAM Institute of Technology, Nitte-574110, Karnataka, India
ABSTRACT
A directed graph D can be labeled antimagically by assigning different integers to its arcs, ensuring that the computed vertex weights are distinct. Antimagic labeling exists in a digraph D with 
arcs and 
vertices if it is possible to uniquely match each arc to an integer from 1 to h. For every vertex, the difference between the totals of the labels from incoming arcs and outgoing arcs is unique for each vertex. A directed graph that allows such antimagic labeling is referred to as an antimagic digraph. There are countless methods to create an antimagic digraph. These constructions are essential in fields such as network theory, coding theory, and combinatorial optimization. The subset sum problem is a well-recognized issue in both computer science and combinatorics. These problems play a decisive role in graph labeling, especially when it comes to the creation and evaluation of specific types of labels. In this paper, we connect the idea of subset sum problems with wheel digraphs 
to represent it as antimagic. The Cartesian product of directed graphs is a fundamental concept in graph theory that holds both theoretical and practical importance. The applications of Cartesian products include network design and analysis, parallel computing, graph decomposition and construction, Game Theory, and Decision-Making. Additionally, in this paper, we have developed antimagic digraphs from the Cartesian product of directed path 
and 
by traversing the directed path 
in alternating and unidirectional ways.
KEYWORDS
Cartesian Product, Wheel Digraph, Subset-sum, Antimagic
Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Ancy Dsouza , Saumya Y M , Kumudakshi , "Antimagic Labeling of Digraphs," Mathematics and Statistics, Vol. 13, No. 2, pp. 105 - 109, 2025. DOI: 10.13189/ms.2025.130205.
(b). APA Format:
Ancy Dsouza , Saumya Y M , Kumudakshi (2025). Antimagic Labeling of Digraphs. Mathematics and Statistics, 13(2), 105 - 109. DOI: 10.13189/ms.2025.130205.