Rough Sets in Graphs Using Similarity Relations
Combinatorics
2021-04-20 v1 Information Theory
math.IT
Abstract
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions, essential sets, discernibility matrix and their relationships for graphs.
Keywords
Cite
@article{arxiv.2104.08743,
title = {Rough Sets in Graphs Using Similarity Relations},
author = {Imran Javaid and Shahroz Ali and Shahid Ur Rehman and Aqsa Shah},
journal= {arXiv preprint arXiv:2104.08743},
year = {2021}
}
Comments
15 pages, 2 figures, 1 table