k-TRIANGULAR PRIME CORDIAL LABELING OF MAXIMAL OUTERPLANAR GRAPHS
By
G. Megala1 and K. Annadurai2
1Research Scholar, Mother Teresa Women’s University, Kodaikanal-624101, Dindigul, Tamil Nadu, India.
Department of Mathematics, M.V. Muthiah Government Arts College for Women, Dindigul-624001, Tamil Nadu, India
2Department of Mathematics, M.V. Muthiah Government Arts College for Women, Dindigul-624001, Tamil Nadu, India
Email: 1megalagpgd@gmail.com, 2anna.vadivu@gmail.com
(Received : March 15, 2022; In format : May 11, 2022; Revised : August 04, 2022; Accepted : October 12, 2022)
DOI: https://doi.org/10.58250/jnanabha.2022.52215
Abstract
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 conditions.
2020 Mathematical Sciences Classification: 05C78.
Keywords and Phrases: riangular graceful labeling, cordial labeling, cordial prime labeling, maximal outerplanar graph.