Rough sets in graphs using similarity relations

Rough sets in graphs using similarity relations

In this paper, we investigate the theory of rough set to study graphs using the concept of orbits. Rough sets are based on a clustering criterion and we use the idea of similarity of vertices under automorphism as a criterion. We introduce indiscernibility relation in terms of orbits and prove neces...

Full description

Bibliographic Details
Main Authors: Imran Javaid, Shahroz Ali, Shahid Ur Rehman, Aqsa Shah
Format: Article
Language:English
Published: AIMS Press 2022-01-01
Series:AIMS Mathematics
Subjects:
automorphisms
discernibility matrix
essential sets
orbit
reduct and rough sets
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2022320?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.2022320?viewType=HTML

Similar Items