New Approximation Operators using Combined Edges Systems
Abstract
In this paper, we introduce new approximation operators such as first lower approximation and first upper approximation of a sub undirected graph ƕ ⊆ Ω by using incident edges system and non-incident edges system respectively. Some properties of these concepts are investigated. In addition the first accuracy of lower and upper approximation operators are introduced and some of its characteristics are studied.
References
Kh. Sh. Al’Dzhabri, A. Hamza and Y. S. Eissa, On DG-topological spaces associated with directed graphs, Journal of Discrete Mathematical Sciences & Cryptography 23(5) (2020), 1039-1046. https://doi.org/10.1080/09720529.2020.1714886
Kh. Sh. Al’Dzhabri and M. F. H. Al’murshidy, On certain types of topological spaces associated with digraphs, Journal of Physics: Conference Series 1591 (2020), 012055. https://doi.org/10.1088/1742-6596/1591/1/012055
Kh. Sh. Al’Dzhabri, A. A. Omran and M. N. Al-Harere, DG-domination topology in digraph, Journal of Prime Research in Mathematics 17(2) (2021), 93-100.
Kh. Sh. Al’Dzhabri, Enumeration of connected components of acyclic digraph, Journal of Discrete Mathematical Sciences and Cryptography 24(7) (2021), 2047-2058. https://doi.org/10.1080/09720529.2021.1965299
L. W. Beineke and R. J. Wilson, Topics in Topological Graph Theory, Cambridge University Press, 2009
F. Harary, Graph Theory, Addison-Wesley, Reading Mass, 1969.
Jesper M. Møller, General Topology, Authors’ Notes, 2007
M. Shokry, Approximations structures generated by trees vertices, International Journal of Engineering Science and Technology (IJEST) 4(2) (2012), 406-418.
M. Shokry, Closure concepts generated by directed trees, Journal of Mathematics & Computer Sciences 21(1) (2010), 45-51.
S. S. Ray, Graph Theory with Algorithms and its Applications: In Applied Sciences and Technology, Springer, New Delhi, 2013.
This work is licensed under a Creative Commons Attribution 4.0 International License.
.jpg){kind=logo}
