Labeled Paths in Cryptography


Authors: Dharmendra Kumar Gurjar and Auparajita Krishnaa
Page Range: 173-194
Published in: International Journal of Mathematics, Game Theory, and Algebra, 30#4
ISSN: 1060-9881

Table of Contents


In recent years, Cryptography has emerged as an important area of research for security purpose. With the increased use of the internet, security now becomes an important challenge in today’s world. So, many researchers are using various mathematical concepts in Cryptography to increase security. The field of Graph Theory, specially Graph Labeling and labeled graphs can be used as important tools for encryption for greater security as compared to many conventional methods used in Cryptography. In this chapter, the labeled Path graphs with various labeling schemes namely harmonious, graceful, sequential and felicitous are being presented as the method of choice for encryption and decryption. Certain other mathematical concepts from Linear Algebra also, have been incorporated with these methods to develop the Cryptography algorithms for data transfer with significantly greater security. The concepts of permutations and combinations also have been used for enhancing the hiding of the messages still further.

Keywords: path, graph labeling, harmonious, graceful, sequential, felicitous, bipartite graph, Path Matrix, Harmonious Path Matrix, Sequential Path Matrix, Felicitous Path Matrix, Graceful Path Matrix, Linear transformation

Subject Classification: (2010) 05C78, 94A60

Publish with Nova Science Publishers

We publish over 800 titles annually by leading researchers from around the world. Submit a Book Proposal Now!