In this work, an attempt has been made to represent and simulate fingerprint pattern analysis mathematically using graph isomorphism, graph dominance and graph pebbling. The idea of categorizing fingerprint by locating the ridge characteristics of fingerprint has been attempted to be implemented in this work. An image of fingerprint is used as an input for mathematical modelling and simulation. For the mathematical modelling and simulation of ridge characteristics in a fingerprint, we define two techniques. For first technique, we define Algorithm  for finding the graphical representation of fingerprint and for second technique, we define Algorithm  for determining whether the graphs of any two fingerprint patterns are isomorphic or not. The objective of this study is to identify that the two fingerprints are similar or different with the help of graph isomorphism, domination in graphs and graph pebbling. Our goal is to improve fingerprint identification accuracy in various orientations.

graph, fingerprints, isomorphism, domination number, graph pebbling.

Received: March 22, 2023; Accepted: May 16, 2023; Published: July 17, 2023

How to cite this article: Jitendra Binwal, Renu Devi and Bhupendra Singh, Mathematical modelling and simulation of fingerprint analysis using graph isomorphism, domination, and graph pebbling, Advances and Applications in Discrete Mathematics 39(2) (2023), 259-284.
http://dx.doi.org/10.17654/0974165823052

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] R. Brigham, J. Carrington and R. D. Dutton, Topics in Domination in Graphs, Springer, 2020.
[2] J. Bondy and U. Murty, Graph Theory with Applications, Elsevier Science Publication, 1982.
[3] T. Haynes, W. Teresa, S. Hedetniemi, T. Stephen and P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker Inc, New York, 1998.
[4] L. Chung and G. Sulong, Fingerprint classification approach, 6th International Symposium on Signal Processing and its Applications, Vol. 1, 2001, pp. 347-350.
[5] C. Easttom, Utilizing graph theory to model forensic examination, International Journal of Innovative Research in Information Security 4 (2017), 1-6.
[6] D. Isenor and S. Zaky, Fingerprint Identification Using Graph Matching Pattern Recogn., Elsevier Science Inc., Vol. 19, 1986, pp. 113-122.
[7] K. Amit. P. Gupta, A. Bhatt and J. Rana, Innovative study to the graph-based data mining: application of the data mining, International Journal of Engineering and Innovative Technology 2 (2012), 47-51.
[8] W. Honglei, O. Zongying and J. Zhang, Fingerprint identification based on ridge lines and graph matching, Intelligent Control and Automation 2 (2006), 9965-9968.
[9] X. Jiang and W. Yau, Fingerprint minutiae matching based on the local and global structures, Proceedings 15th International Conference on Pattern Recognition, 2000.
[10] W. Douglas, Introduction to Graph Theory, 2nd ed., Prentice Hall, Upper Saddle River, NJ, 2001.
[11] J. Nieminen, Two bounds for the domination number of a graph, J. Inst. Math. Appl. 14 (1974), 183-187.