Abstract
In this paper we study properties of the graph G(T), associated with an arbitrary decision table T. The set of vertices of G(T) coincides with the set of conditional attributes of T belonging to at least one decision reduct for T, and the set of edges coincides with the set of pairs of attributes which do not belong to any decision reduct for T.