Edge rough graph and its application
Meilian Liang, Binmei Liang, Linna Wei, Xiaodong Xu · 2011
Mining data that is represented as a graph by rough set theory is studied in this paper. Edge rough graph is first introduced, which can be easily combined with many powerful methods developed in graph theory, to deal with uncertainty, inconsistency and incompleteness in data represented as graphs. Then based on the notion of group, a specific relation over the edge set of a graph is defined, by which any graph can be approximated by a pair of Cayley graphs. An application of edge rough graph in computing bounds on clique numbers of graphs is given.