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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
