SECURE VERTEX-EDGE DOMINATION IN HYPERCUBE AND GRID GRAPHS: APPLICATIONS OF CYBERSECURITY IN BANKING FOR SECURE TRANSACTIONS

• Published in: Journal of mechanics of continua and mathematical sciences Vol. 20; no. 6; pp. 51 - 64
• Main Authors: Sharmila, C. Ruby, Meenakshi, S
• Format: Journal Article
• Language: English
• Published: Institute of Mechanics of Continua and Mathematical Sciences 01.06.2025
• Subjects: cybersecurity threats; graph theory; grid graphs; hypercube graphs; secure transaction; secure vertex-edge domination
• ISSN: 0973-8975; 2454-7190
• DOI: 10.26782/jmcms.2025.06.00004

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.