TARU PUBLICATIONS
Journal of Interdisciplinary Mathematics cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-012X·ISSN (Print): 0972-0502

Freq.: MONTHLY - Publishes the methodological and theoretical role of mathematics and mathematical applications underpinning scientific research.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Closed-neighborhood soft topology on soft graphs

* ,

* Corresponding author · click or hover a name for details

pp. 1343–1349Vol. 29Issue 5-AMay 2026DOI: 10.47974/JIM-2591XML
Received:
01 Jan 2026
Published Online:
27 Jun 2026
Article type:
Research Article
Language:
EN
Article no.:
JIM-2591
Pages:
1343–1349

Abstract

In this paper, we introduce a new soft topological structure on soft graphs based on the concept of closed neighborhoods of vertices. By associating each vertex with its closed neighborhood and its complement, we construct a family of soft sets that serves as a subbase for a soft topology on the vertex set of a given soft graph. This construction naturally induces a closed-neighborhood soft topology whose properties are investigated through several illustrative graph classes. The proposed framework establishes a systematic connection between graph-theoretic neighborhood structures and soft topological spaces, providing a flexible setting for further theoretical developments in soft graph theory. 

Keywords

Subject Classifications

Primary 54A05Secondary 05C7554C05

References

[1] K. Ruohonen, Graph Theory, Lecture Notes, Tampere University of Technology (2013).
[2] J. Harris, J. L. Hirst, and M. Mossinghoff, Combinatorics and Graph Theory, Undergraduate Texts in Mathematics. New York, USA: Springer (2008), doi: 10.1007/978-0-387-79711-3.
[3] K. Guest, S. H. Holliday, P. D. Johnson Jr., D. Rautenbach, and M. Walsh, “Closed-neighborhood union-closed graphs,” Australasian Journal of Combinatorics, vol. 77, pp. 144–156 (2020).
[4] J. A. Bondy and U. S. R. Murty, Graph Theory, Graduate Texts in Mathematics, vol. 244, London, UK: Springer, pp. 663 (2008).
[5] D. Molodtsov, “Soft set theory—first results,” Computers & Mathematics with Applications, vol. 37, no. 4–5, pp. 19–31 (1999).
[6] P. K. Maji, A. R. Roy, and R. Biswas, “An application of soft sets in a decision-making problem,” Computers & Mathematics with Applications, vol. 44, no. 8–9, pp. 1077–1083 (2002), doi: 10.1016/S0898‑1221(02)00216‑X.
[7] R. K. Thumbakara and B. George, “Soft graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 17, no. 5, pp. 1–15 (2014). 
[8] M. Akram and S. Nawaz, “Operations on Soft Graphs,” Fuzzy Information and Engineering, vol. 7, no. 4, pp. 423–449 (Dec. 2014), doi: 10.1016/j.fiae.2015.11.003.
[9] K. Palani, T. Jones, and V. Maheswari, “Soft Graphs of Certain Graphs,” Journal of Physics: Conference Series, vol. 1947, no. 1, art. 012045, pp. 1–7 (2021), doi: 10.1088/1742‑6596/1947/1/012045.
[10] R. K. Thumbakara, J. Jose, and B. George, “Hamiltonian Soft Graphs,” GANITA, vol. 72, no. 1, pp. 145–151 (2022).
[11] J. D. Thenge, B. S. Reddy, and R. S. Jain, “Connected Soft Graph,” New Mathematics and Natural Computation, vol. 16, no. 2, pp. 305–318 (2020), doi: 10.1142/S1793005720500180.
[12] S. Hussain and B. Ahmad, “Soft separation axioms in soft topological spaces,” Hacettepe Journal of Mathematics and Statistics, vol. 44, no. 3, pp. 559–568 (2015), doi: 10.15672/HJMS.2015449426.

Views: 30Downloads: 4Citations: 0