Rough Sets for n-Cycles and n-Paths

Abstract

In this paper we carry out a research project whose main goal is the study of an undirected graph by means of investigation tools provided by Pawlak rough set theory. Specifically, we determine both the lower and the upper rough approximation functions for an information table induced from a cycle or a path on n vertices. For such graphs we also provide a complete description of the corresponding exact subsets.