Affiliations: [a] Department of Mathematics and Informatics, University of Calabria, Via Pietro Bucci, Cubo 30B, 87036 Arcavacata di Rende (CS), Italy. [email protected] | [b] Department of Informatics, Systems and Communication, Università di Milano – Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. [email protected] | [c] Department of Mathematics and Informatics, University of Calabria, Via Pietro Bucci, Cubo 30B, 87036 Arcavacata di Rende (CS), Italy. [email protected] | [d] Department of Mathematics and Informatics, University of Calabria, Via Pietro Bucci, Cubo 30B, 87036 Arcavacata di Rende (CS), Italy. [email protected]
Correspondence:
[*]
Address for correspondence: Department of Mathematics and Informatics, University of Calabria, Via Pietro Bucci, Cubo 30B, 87036 Arcavacata di Rende (CS), Italy.
Abstract: In this paper we apply rough set theory to information tables induced from finite directed graphs without loops and multiples arcs (digraphs). Specifically, we use the adjacency matrix of a digraph as a particular type of information table. In this way, we are able to explore on digraphs the notions of indiscernibility partitions, lower and upper approximations, generalized core, reducts and discernibility matrix. All these ideas will be exemplified on standard digraph families as well on examples from social networks and patterns of flight routes between airports.
Keywords: Rough set theory, digraph, attribute dependency, hypergraph minimal transversal
