Refrences
- Krishnaa A. and Dulawat M.S., “Algorithms for Inner Magic and Inner Antimagic Labelings of Some Planar Graphs”, Informatica, 17(3), 393-406, (2006).
- Femina P. and Antony Xavier D., “A Study of Data Encryption Standard Using Graph Theory”, 2nd International Conference on Science, Technology and Management, University of Delhi, New Delhi, India (2015).
- Selvakumar R. and Nishant Gupta, “Fundamental circuits and cut-sets used in cryptography”, Journal of Discrete Mathematical Sciences and Cryptography, 15(4 & 5), 287-301, (2012). doi: 10.1080/09720529.2012.10698381
- Chase M. and Kamara S., Structured Encryption and Controlled Disclosure, Advances in Cryptography-ASIACRYPT 2010, December 2010, Springer-Verlag (2010).
- Tokareva N., Connections between graph theory and cryptography, G2C2:Graphs and Groupts, Cycles and Coverings, September 24-26, Novosibirsk, Russia (2014).
- Krishnaa A., “An Example Usage of Graph Theory in Other Scientific Fields : On Graph Labeling, Possibilities and Role of Mind/Consciousness”, Chapter in book : “Graph Theory : Advanced Algorithms and Applications”, IntechOpen, London,UK. http://doi.org/10.5772/65595, (2018)
- Regees M., Super edge trimagic total labeling of some star type graphs, Journal of Discrete Mathematical Sciences and Cryptography, 20(3), 747-754; https://www.tandfonline.com/doi/abs/10.1080/09720529.2017.1293906, (2017)
- Kahate A., Cryptography and Network Security, 3rd edition, McGraw Hill Education (India) Pvt. Ltd., Chennai, India.
- Krishnaa A., “Computer Modelling of Graph Labelings”, proc. National Conference on Mathematical and Computational Models”, Coimbatore, India, Allied Publishers, India, (2001).
- Krishnaa A., “A Note on a Graph Labelling Scheme and its Computational Complexity”, Journal of Computer and Mathematical Sciences, 2(3), 521-524, (2011).
- Krishnaa A.. “A Note On Some Thoughts on the Graceful Tree Conjecture”, Journal of Discrete Mathematical Sciences and Cryptography, 16(6), 387-392. DOI : 10.1080/09720529.2013.858484, (2013).
- NP-Completeness, NP(Complexity), Wikipedia.