k-TRIANGULAR PRIME CORDIAL LABELING OF MAXIMAL OUTERPLANAR GRAPHS
G. Megala, K. Annadurai · jnanabha · 2022
In this paper, we study graph labeling, namely, k- triangular prime cordial labeling for k = 1, 2, 3, 4, 5, 6. This is a simple extension of prime cordial labeling where the vertex labels are defined as the higher order triangular numbers. Also we show that the maximal outerplanar graphs are k- triangular prime cordial under certain conditio