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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
