Abstract
In this paper, we define a Cayley graph corresponding to the Rough ideal J of the Rough semiring (T, ∆, ∇). The Domination number of the Rough Ideal based Rough Edge Cayley graphs and )) where contains the non-trivial elements of J are derived and illustrated through examples. Interpretation of a communication network is done in the form of Rough Ideal based Rough Edge Cayley Graph.
Highlights
The concept of Rough set theory was proposed by Pawlak, [10] to deal with the incomplete information system
The concept of ideals on Rough sets have been discussed by A.Manimaran, et al The characterization of Rough semiring was discussed by A.Manimaran, et al [4]
This paper is organised as follows: In section 2, we give some preliminary definitions on Rough set theory, Graph Theory and Rough Ideal based Rough Edge Cayley graph
Summary
The concept of Rough set theory was proposed by Pawlak, [10] to deal with the incomplete information system. The concept of semiring on rough sets were discussed by B.Praba, et al [7]. The concept of Edge Rough graph and its applications were discussed by Meilian Liang, et al [5].There are been many research works done on Algebraic graph theory. In our paper we give an algebraic graph theoretical approach to rough sets and discuss on the Rough Ideal based Rough Edge Cayley graphs [8]. This paper is organised as follows: In section 2, we give some preliminary definitions on Rough set theory, Graph Theory and Rough Ideal based Rough Edge Cayley graph.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
