Enhancing Message Security Using Product Labelling and Edge Deletion in Complete Bipartite Graphs

In this paper, we propose a novel encoding and decoding algorithm designed to enhance message security through the use of product labelling of a complete bipartite graph combined with an edge deletion strategy. We demonstrate the efficacy of our method through theoretical analysis and practical implementation, showcasing its potential for applications in secure communication systems. The combination of product labelling and edge deletion in a complete bipartite graph framework provides a robust and secure mechanism for data encoding and decoding, significantly enhancing the protection of sensitive information. This secure labelling scheme has applications in various fields, including secure graph data mining, privacy-preserving graph analysis, and cryptographic graph theory. Our approach guarantees that even if an adversary gains partial access to the encoded message and complex labelling scheme will prevent the complete reconstruction of the original data.