Skip to Main Content
The paper presents a new form of indiscernibility relation based on graph. Based on widely accepted definitions of indiscernibility relation and its matrix representation, it has been shown how the indiscernibility relations can be obtained by a graph. The application of the indiscernibility graph enables the partitioning of the universe of objects represented by their attributes. This is in connection with the Rough sets theory (Z. Pawlak, 1980s). The relation between state space, when applied to the indiscernibility graph, is also theoretically discussed. Formal definitions are accompanied by some examples.