Simple graphs in granular computing.

Given a graph, we interpret its adjacency matrix as an information table. We study this correspondence in two directions. Firstly, on the side of graphs by applying to it standard techniques from granular computing. In this way, we are able to connect automorphisms on graphs to the so-called indiscernibility relation and a particular hypergraph built from the starting graph to core and reducts. On the other hand, new concepts are introduced on graphs that have an interesting correspondence on information tables. In particular, some new topological interpretations of the graph and the concept of extended core are given. [ABSTRACT FROM AUTHOR]