Journal
INFORMATION SCIENCES
Volume 340, Issue -, Pages 279-304Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2015.12.042
Keywords
Granular computing; Information tables; Rough set theory; Reduct hypergraph; Simple graphs; Petersen graph
Categories
Ask authors/readers for more resources
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. (C) 2016 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available