  In this paper, we use theory of rough set to study graphs using the concept
of orbits. We investigate the indiscernibility partitions and approximations of
graphs induced by orbits of graphs. We also study rough membership functions,
essential sets, discernibility matrix and their relationships for graphs.
