Palindromic Antimagic Labeling of Products of Paw and Banner Graph

This article presents a novel classification of Antimagic labeling referred to as Palindromic antimagic. Palindromic Antimagic labeling pertains to the assignment of palindromic numbers ℘1, ℘2, ℘3. . . ℘q to the set of edges of a graph G = (V, E), where G consists of p vertices and q edges. This labeling is characterized by being invertible, meaning that each edge is uniquely associated with a palindromic number. Additionally, it involves an injective mapping of vertex labeling, where the sum of incident edges for any given vertex is distinct from one another. Inthis study, we examine the palindromic antimagic labeling of Cartesian and Tensor product of certain Tadpole graphs, such as the paw and banner graph.