Definition :1

Let U =( W , X ) be a universe graph with W ={w1 , w2 , w3 , ….. w n } be the vertex set and
X ={x 1 , x 2 , x 3 … … x n } be the edge set of U . For any A={s1 , s 2 , s3 , … . s n be the attribute set
defined on U is classified into different similarity classes [ x ] s.Let H= ( K , L ) be a graph,
where K ⊆ W and L ⊆ X , graph H is said to be A -definable graph or exact graph if L is the
union of some [ x ] s, conversely it is said to be A rough graph.
Definition :2

For any A−¿ rough graph, two exact graphs A ( H )=( K , A ( L ) ) and A ( H )=( K , A ( L ) ) can be
defined it as
A ( L )={e ∈ X∨[ x ] s ⊆ L}

A ( L )={e ∈ X∨[ x ] s ∩ L≠ ϕ }

The graph A ( H ) and A ( H ) are called A−¿ lower approximation of H and A−¿upper
approximation H .The pair of ( A ( H ) , A ( H ) ) is called A−¿rough graph.

The boundary region of A−¿rough graph is defined as BN = A ( H )− A ( H ).

U =( W , X ) H= ( K , L )

W ={a ,b ,c , d , e}
K={a , b , c , d }
A={{b , c },{a , d }, {a ,e , d }, {b , c , f }, {b , f }, {e , d }}
Y ={a , b , c }
A=\{ a ,b , c , d , e , f \}
BN ( Y )=\{ a , d , ef \}