JOURNAL OF THE INDIAN ACADEMY OF MATHEMATICS

(Published by Indian Academy of Mathematics since 1978)

Promoting Research in Pure and Applied Mathematics

ISSN 0970-5120


HomeArchiveContents
← Back to Volume 47, Issue 2 Contents

ENHANCINGSCADACYBERSECURITY THROUGHNEUTROSOPHIC GRAPH TOPOLOGICALANALYSIS

Mohanapriya Rajagopal1, Durgadevi Shanmugasundaram2
1 Department of Mathematics, Sri Krishna Adhithya College of Arts and Science, Coimbatore, India - 641042
2 Department of Mathematics, Sri Krishna Adhithya College of Arts and Science, Coimbatore, India - 641042
Volume: 47Issue: 2Pages: 349–358Year: 2025ISSN: 0970-5120
⬇ Download Full PDF

Abstract

This manuscript extends the concept of graph topology to neutrosophic graph topological spaces by incorporating uncertainty and indeterminacy into graph topological structures. Building on existing work in graph topologies, we introduce neutrosophic components that utilize truth membership ($T$), indeterminacy ($I$), and falsity membership ($F$) values to handle incomplete and contradictory information. We establish foundational definitions and examine important topological properties including neutrosophic connectedness, separation axioms ($T_0, T_1, T_2$). Several theorems are presented with complete proofs, including the equivalence of neutrosophic connectedness conditions and the hierarchical relationship between separation axioms. The framework is demonstrated through a practical cybersecurity application, where neutrosophic graph topology is used to model SCADA network vulnerabilities, identify secure zones, and analyze potential attack vectors in power grid systems.
Keywords: Neutrosophic graph topology, neutrosophic connectedness, neutrosophic separation, network security, SCADA systems.
MSC 2020: Primary: 54A05, 54A10; Secondary: 94C15

How to Cite

Mohanapriya Rajagopal, Durgadevi Shanmugasundaram, ENHANCINGSCADACYBERSECURITY THROUGHNEUTROSOPHIC GRAPH TOPOLOGICALANALYSIS, Journal of the Indian Academy of Mathematics, 47(2) (2025), 349–358.

References

  • Aniyan, A., & Naduvath, S. (2023). A study on graph topology. Communications in Combinatorics and Optimization, 8(2), 397–409. DOI: 10.22049/CCO.2022.27399.1253
  • Biswas, P., Pramanik, S., & Giri, B. C. (2014). Cosine similarity measure based multi-attribute decision-making with trapezoidal fuzzy neutrosophic numbers. Neutrosophic Sets and Systems, 8, 46–56.
  • Bondy, J. A., & Murty, U. S. R. (2008). Graph Theory. Springer.
  • Broumi, S., & Smarandache, F. (2014). Single valued neutrosophic graphs. Journal of New Theory, (10), 86–101.
  • Diestel, R. (2017). Graph Theory (5th ed.). Springer.
  • Langner, R. (2011). Stuxnet: Dissecting a cyberwarfare weapon. IEEE Security & Privacy, 9(3), 49–51.
  • Munkres, J. R. (2000). Topology (2nd ed.). Prentice Hall.
  • Newman, M. E. J. (2018). Networks: An Introduction (2nd ed.). Oxford University Press.
  • Smarandache, F. (1999). A Unifying Field in Logics: Neutrosophic Logic, Neutrosophy, Neutrosophic Set, Neutrosophic Probability. American Research Press.
  • Stouffer, K., Falco, J., & Scarfone, K. (2011). Guide to industrial control systems (ICS) security. NIST Special Publication 800-82.
  • Wang, H., Smarandache, F., Zhang, Y., & Sunderraman, R. (2010). Single valued neutrosophic sets. Multispace and Multistructure, 4, 410–413.
  • West, D. B. (2001). Introduction to Graph Theory (2nd ed.). Prentice Hall.
  • Ye, J. (2013). Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. International Journal of General Systems, 42(4), 386–394.
  • Ye, J. (2014). A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. Journal of Intelligent & Fuzzy Systems, 26(5), 2459–2466.
  • Zhu, B., Joseph, A., & Sastry, S. (2011). A taxonomy of cyber attacks on SCADA systems. Proceedings of the 2011 International Conference on Internet of Things and 4th International Conference on Cyber, Physical and Social Computing, 380–388.

© Journal of the Indian Academy of Mathematics