Authors:
C. Ruby Sharmila,S. Meenakshi,DOI NO:
https://doi.org/10.26782/jmcms.2025.06.00004Keywords:
Secure Vertex-Edge Domination,Hypercube graphs,Grid graphs,Graph theory,Cybersecurity threats,Secure Transaction,Abstract
In the banking sector, safeguarding sensitive financial transactions is critical to maintaining customer trust and regulatory compliance. Cybersecurity threats, ranging from data breaches to unauthorized access, necessitate robust protective measures. However, the majority of research places a strong emphasis on vertex dominance in security networks while ignoring the importance of edge defense for overall security, also hypercube and grid structures are not considered. Furthermore, conventional studies have ignored the potential of hypercube and grid graph structures in enhancing security measures. Hence this research proposed a secure vertex-edge domination (SVED) in hypercube and grid graphs, exploring their applications in optimizing cybersecurity measures for secure transaction monitoring. Moreover, develop a Hidden Markov Model (HMM) framework to enhance the detection of anomalous activities within these graph structures. This algorithm efficiently computes the minimum number of security agents required to monitor transaction flows, thus reducing vulnerabilities. This research not only fills a critical gap in existing network security methodologies but also proposes a novel framework for protecting complex networks from evolving cyber threats, thereby advancing the frontier of cybersecurity and mathematical graph theory.Refference:
I. A. Majeed, and I. Rauf, ‘Graph theory: A comprehensive survey about graph theory applications in computer science and social networks,’ Inventions, vol. 5, no. 1, pp. 10, 2020. 10.3390/inventions5010010
II. A. Sahin, and B. Sahin, ‘Total edge–vertex domination,’ RAIRO-Theoretical Informatics and Applications, vol. 54, pp. 1, 2020.
III. A.I. Al-Alawi, and , M.S.A. Al-Bassam, ‘The significance of cybersecurity system in helping managing risk in banking and financial sector,’ Journal of Xidian University, vol. 14, no. 7, pp. 1523-1536, 2020. 10.37896/jxu14.7/174
IV. A.Q. Stanikzai, and M.A. Shah, ‘Evaluation of cyber security threats in banking systems,’ In 2021 IEEE Symposium Series on Computational Intelligence (SSCI), IEEE, pp. 1-4, 2021, December. 10.1109/SSCI50451.2021.9659862
V. B. Dumitrescu, A. Băltoiu, and Ş. Budulan, ‘Anomaly detection in graphs of bank transactions for anti money laundering applications,’ IEEE Access, vol. 10, pp. 47699-47714, 2022. 10.1109/ACCESS.2022.3170467
VI. C. Wang, and H. Zhu, ‘Wrongdoing monitor: A graph-based behavioral anomaly detection in cyber security,’ IEEE Transactions on Information Forensics and Security, vol. 17, pp. 2703-2718, 2022. 10.1109/TIFS.2022.3191493
VII. D. Angel, A. Arputhamary, and S. Saffren, ‘Defense Mechanism for the Nodes of 2-D Meshes and n-cubes,’ In 2021 International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT), IEEE, pp. 1-4, 2021, February. 10.1109/ICAECT49130.2021.9392622
VIII. D. Angel, G. Uma, and E. Priyadharshini, ‘Application of Graph theory to Defend Hypercubes and Matching Graph of Hypercube Structures Against Cyber Threats,’ In 2023 First International Conference on Advances in Electrical, Electronics and Computational Intelligence (ICAEECI), IEEE, pp. 1-4, 2023, October. 10.1109/ICAEECI58247.2023.10370916
IX. H.M. Alzoubi, T.M. Ghazal, M.K. Hasan, A. Alketbi, R. Kamran, N.A. Al-Dmour, and S. Islam, ‘Cyber security threats on digital banking,’ In 2022 1st International Conference on AI in Cybersecurity (ICAIC), IEEE, pp. 1-4, 2022, May. 10.1109/ICAIC53980.2022.9896966
X. J. Wang, S. Zhang, Y. Xiao, and R. Song, ‘A review on graph neural network methods in financial applications,’ arXiv preprint arXiv:2111.15367, 2021′
XI. J. Zhang, W. Wang, and E. Zio, ‘Study on the Application of Graph Theory Algorithms and Attack Graphs in Cybersecurity Assessment,’ In 2023 7th International Conference on System Reliability and Safety (ICSRS), IEEE, pp. 558-564, 2023, November. 10.1109/ICSRS59833.2023.10381005
XII. K. Golubev, ‘Graphical designs and extremal combinatorics,’ Linear Algebra and its Applications, vol. 604, pp. 490-506, 2020. 10.1016/j.laa.2020.07.012
XIII. K. Zhang, and J. Liu, ‘Review on the application of knowledge graph in cyber security assessment,” In IOP Conference Series: Materials Science and Engineering, IOP Publishing, vol. 768, no. 5, pp. 052103, 2020, March.
XIV. Kulli, V.R., ‘Secure edge domination in graphs,’ Annals of Pure and Applied Mathematics, vol. 12, no. 1, pp. 95-99, 2016.
XV. R. Boutrig, M. Chellali, T.W. Haynes, and S.T. Hedetniemi, ‘Vertex-edge domination in graphs,’ Aequationes mathematicae, vol. 90, pp. 355-366, 2016. 10.1007/s00010-018-0609-9
XVI. R. Jain, and R. Tewari, ‘Grid Graph Reachability,’ arXiv preprint arXiv:1902.00488, 2019.
XVII. T.T. Chelvam, and , M. Sivagami, ‘Structure and substructure connectivity of circulant graphs and hypercubes,’ Arab J. Math. Sci, vol. 27, no. 1, pp. 94-103.
XVIII. Z. DeVivo, and R.K. Hladky, ‘New Upper Bounds on the Minimal Domination Numbers of High-Dimensional Hypercubes,’ arXiv preprint arXiv:2409.14621, 2024. 10.48550/arXiv.2409.14621