An effective algorithm for gracefulness on the cartesian product of cayley digraphs

Abstract

Labeled digraphs are frequently used to denote real-world issues because of their unique features. They were employed in modelling communication, interconnection networks, parallel computer architecture, field of bioinformatics and issues with DNA sequencing. Graceful labelings are proven to exist for a number of infinite classes of graphs. One can treat the present work as assistance to pick a suitable combinatorial model of large directed secured networks.