Rough set analysis of graphs

Relational data has become increasingly important in decision analysis recent years, and so mining knowledge which preserves relationships between objects is an topic. Graphs can represent the contains objects. Rough set theory provides effective tool for extracting knowledge, but it not sufficient to extract containing on In order extend application scope enrich rough theory, essential develop a of graphs. This extension because graphs play crucial role social network analysis. this paper, based general binary relations investigated. We introduce three types approximation operators graphs: vertex graph operators, edge operators. Relationships sets are presented. Then we investigate within constructive axiomatic approaches.