Antimagic Naming of Specific Groups of Digraphs Utilizing Snared Skolem Arrangement

Abstract

The vertex sum at each given vertex u is equal to the total of all the edges directed into it minus the sum of all the edges directed out of it. This is known as an anti magicl abeling of a directed graph G with v vertices and q edges. An antimagic digraph is a digraph that permits an antimagiclabeling. In this paper, we analyze a few antimagic digraph features and use hooked Skolem sequences to demonstrate the anti magicness of specific digraph families.