In this paper, we define the Total graph and the complemented graph of a rough semiring (T, ∆, ∇). We prove that the existence theorem of the total graph and the complemented graph on (T, ∆, ∇) for X ⊆ U where U is the finite universal set on the set of all rough sets for the given information system I = (U, A) together with the operations praba ∆ and praba ∇. We illustrate these concepts through examples.
Journal Section | Mathematics |
---|---|
Authors | |
Publication Date | June 21, 2016 |
Published in Issue | Year 2016 Volume: 29 Issue: 2 |