January 2025
·
64 Reads
International Journal of Information Technology
This paper explores the concept of-labeling in graph theory, introduced in 2021. It addresses the problem of identifying graphs that can be labeled with-labeling and presents generalized results for various graph families. These include path-allied graphs, cycle-related graphs, uni-cycle graphs, and hairy cycles. Practical algorithms are provided for selected graph types, with an application to DNA sequence alignment demonstrated.