Some Algorithms of Graph Theory in Cryptology

Main Article Content

Auparajita Krishnaa

Abstract

The inventive use of concepts from Graph Theory plays a significant role in hiding the original Plain-text for resulting in a significantly safe data transfer. In this work, the tree traversal algorithms like Inorder, Preorder, Postorder, Kruskal’s algorithm for making minimal spanning tree and the modified graph labelling scheme of graceful labelling allowing repetition of exactly one vertex label for certain graphs, have been employed to create highly hidden Cipher-texts. Encryption and decryption algorithms for all these methods are being presented in this work.

Downloads

Download data is not yet available.

Article Details

How to Cite
[1]
Auparajita Krishnaa , Tran., “Some Algorithms of Graph Theory in Cryptology”, IJAM, vol. 4, no. 1, pp. 9–15, Apr. 2026, doi: 10.54105/ijam.A1167.04010424.
Section
Articles

How to Cite

[1]
Auparajita Krishnaa , Tran., “Some Algorithms of Graph Theory in Cryptology”, IJAM, vol. 4, no. 1, pp. 9–15, Apr. 2026, doi: 10.54105/ijam.A1167.04010424.

References

Kolman B., Busby R.C. and Ross S.C. (2002) Discrete Mathematical Structures, Pearson Education India, Delhi, India.

Katz J, (2003), “Binary Tree Encryption: Constructions and Applications”, International Conference on Information Security and Cryptology – ICISC 2003, Part of the Lecture Notes in Computer Science book series, 1-11, Springer Link. https://doi.org/10.1007/978- 3-540-24691-6_1

Auparajita Krishnaa and M.S. Dulawat (2011), “Study of the Effect of the Repeated Vertex Labels”, Ultra Scientist of Physical Sciences, 23 (1), 176-180.

Shoba M Shanmugam (2017), “Cryptographic Techniques using Binary Tree and Tree Traversal”, International Journal of Scientific Research in Science and Technology, Vol 3, Issue 1, 175-180.

Sivakumar T., Humshavarthini K, Jayasree M and Eswaran M (2017), “Data Encryption Using Binary Tree Traversal (DEBTT)”,

International Journal of Advanced Technology in Engineering and Scince, vol 5, issue no. 04, 353-362.

Aupaarajita Krishnaa (2019) “Inner magic and inner antimagic graphs in cryptography”, Journal of Discrete Mathematical Sciences and Cryptography, 22 (4), 1057-1066, https://doi.org/10.1080/09720529.2019.1675298

Auparajita Krishnaa (2021), “Certain Specific Graphs in Cryptography”, Advances and Applications in Discrete Mathematics, 26(2), 157-177.. https://doi.org/10.17654/DM026020157

Auparajita Krishnaa (2022), “Lattices in Cryptology”, Aryabhatta Journal of Mathematics and Informatics, 14(1), 111-124. https://doi.org/10.5958/2394-9309.2022.00063.4

Auparajita Krishnaa and Dharmendra Kumar Gurjar (2023), “The Concept of Basic Cipher Text for Enhancing Security in the Algorithms of Cryptography Applications Using Labelled Graphs”, International Journal of Scientific Research in Mathematical and Statistical Sciences,10(3), 09-13.

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 > >>