New rough approximations for n-cycles and n-paths

In this paper, we continue the study of a finite simple undirected graph through the rough set techniques introduced by Pawlak in the early 80's. In this sense, we focus on the Boolean information system induced from a circle or a line graph with n vertices and, for such graphs, we provide a complete description of the rough membership function and some results on the positive regions and the attribute dependency function.