δ and prime-labelling of a tree from caterpillars
A. Sethukkarasi, S. Vidyanandini, Soumya Rajan Nayak · Journal of Discrete Mathematical Sciences and Cryptography · 2024
This paper explores δ-labelling and prime labelling for trees derived from caterpillar structures. In δ-labelling, vertex labels induce injective edge labels, while prime labelling ensures adjacent vertices have a greatest common divisor of one. An algorithm for efficiently labelling caterpillar trees using both methods is introduced. These labelling techniques have practical applications in network security and cryptography, providing new strategies to strengthen the security and robustness of communication networks and cryptographic systems.