New Rough Sets Properties on Graph Theory
Abd-El Aziz, Elsayed Radwan, Mohammed Shokry Nayle, Ahmed Ibrahem Nasir · 2012
The aim of this paper is to determine the definable (crisp or exact) sub graphs in a graph G(V,E) without make any table. So we introduced new types of measures of approximation to get a higher (maximal) accuracy to determination the sub graph H of a graph G. Finally we show the relation among these types and other types of approximations and we study some of their basic properties. In this paper, without make any table but only by see on any graph we can signalize which sub graphs are definable.