TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

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

Οn digclοsure οperatοrs

* , ,

* Corresponding author · click or hover a name for details

pp. 333–340Vol. 28Issue 2March 2025DOI: 10.47974/JDMSC-1869 Crossmark XML
Received:
13 May 2024
Published Online:
21 Mar 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1869
Pages:
333–340

Abstract

The purpοse οf this study is tο use a nοvel definitiοn οf the⨮IGm-clοsure οperatοr οn οut-linked digs tο prοduce cοnstructiοn οf tοpοlοgy οn the pοwer set οf vertices οf digs. Sοme tοpοlοgical structure’s prοperties are investigated, and sοme οf the instances are οffered. We alsο define new generalizatiοn subdigraph called R-οpen subdigraph and lοοk at their accuracy.

Keywords

Subject Classifications

05C30

References

[1] A. J. M. Khalaf, M. F. Hanif, M. K. Siddiqui, and M. R. Farahani, “On degree based topological indices of bridge graphs,” J. Discrete Math. Sci. Cryptography, vol. 23, no. 6, pp. 1139-1156 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.1822040.
[2] F. G. Arenas, “Alexandroff space,” Acta Math. Univ. Comenian., vol. 68, pp. 17-25 (1999).
[3] G. Chartrand and P. Zhang, A First Course in Graph Theory, Dover Publications, USA (2012).
[4] J. W. Evane, F. Harary, and M. S. Lynn, “On the computer enumeration of finite topology,” Commun. ACM, vol. 10, no. 5, pp. 295-297 (1967). [Online]. Available: https://doi.org/10.1145/363282.363311.
[5] K. S. Al’Dzhabri and M. F. Hani, “On certain types of topological spaces associated with digraphs,” J. Phys.: Conf. Ser., vol. 1591, p. 012055 (2020). [Online]. Available: https://doi.org/10.1088/1742-6596/1591/1/012055.
[6] K. S. Al’Dzhabri, “Enumeration of connected components of acyclic digraph,” J. Discrete Math. Sci. Cryptography, vol. 24, no. 7, pp. 2047-2058 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2021.1965299.
[7] K. S. Al’Dzhabri, M. Hamza Abedal-H, and Y. S. Eissa, “On DG-topological spaces associated with directed graphs,” J. Discrete Math. Sci. Cryptogr., vol. 23, no. 5, pp. 1039-1046 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.1714886.
[8] K. S. Al’Dzhabri, A. A. Omran, and M. N. Al-Harere, “DG-domination topology in digraph,” J. Prime Res. Math., vol. 17, no. 2, pp. 93-100 (2021). [Online]. Available: http://jprm.sms.edu.pk/.
[9] S. A. Hazem and K. S. Al’Dzhabri, “Some topological concepts associated with graphs,” AIP Conf. Proc., vol. 2414, p. 040029 (2023). [Online]. Available: https://doi.org/10.1063/5.0114854.
[10] K. S. Al’Dzhabri and F. K. Al-Basri, “On bornological topological space and digraphs,” AIP Conf. Proc., vol. 2414, p. 040014 (2023). [Online]. Available: https://doi.org/10.1063/5.0115082.
[11] K. S. Al’Dzhabri and I. V. Rodionov, “On some formulas in the problem of enumeration of finite labeled topologies,” Discrete Math., Algorithms Appl., vol. 15, no. 2, p. 2250075 (2023). [Online]. Available: https://doi.org/10.1142/S1793830922500756.
[12] K. S. Al’Dzhabri and I. V. Rodionov, “On enumeration of labeled connected transitive digraphs,” J. Interdiscip. Math., vol. 26, no. 6 (2023). [Online]. Available: https://doi.org/10.47974/JIM-1631.
[13] S. S. Ray, Graph Theory with Algorithms and its Applications: In Applied Sciences and Technology, Springer, New Delhi (2013).
[14] N. H. A. M. Saidi, M. N. Husin, and N. B. Ismail, “On the Zagreb indices of the line graphs of polyphenylene dendrimers,” J. Discrete Math. Sci. Cryptography, vol. 23, no. 6, pp. 1239-1252 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.1822041.
[15] X. Zhang, A. Razzaq, K. Ali, S. T. R. Rizvi, and M. R. Farahani, “A new approach to find eccentric indices of some graphs,” J. Inf. Optim. Sci., vol. 41, no. 4, pp. 865-877 (2020). [Online]. Available: https://doi.org/10.1080/02522667.2020.1744304.
[16] M. Cancan, D. Afzal, S. Hussain, F. Afzal, and A. Maqbool, “Some new topological indices of silicate network via M-polynomial,” J. Discrete Math. Sci. Cryptography, vol. 23, no. 6, pp. 1157-1171 (2020). [Online]. Available: https://doi.org/10.1080/09720529.2020.180977.
[17] A. H. Alwan, “Small intersection graph of subsemimodules of a semimodule,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2022, no. 1, pp. 15-22 (2022).
[18] S. Ediza, M. Cancana, M. R. Farahani, “Eccentric connectivity and connective eccentricity indices of generalized Petersen graphs,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2021, no. 1, pp. 1-6 (2021).
[19] R. Ponraj, S. Prabhu, and M. Sivakumar, “Pair mean cordial labeling of total graph of some graphs and prism related graphs,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 181-192 (2024).
[20] F. O. Oduol and I. O. Okoth, “Counting vertices among all noncrossing trees by levels and degrees,” Commun. Combinatorics Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 193-212 (2024).

Views: 79Downloads: 6Citations: 0