It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Rough set theory had been proposed by Pawlak in the early of 1982. The theory is a new mathematical tool to deal with vagueness and imperfect knowledge. In this paper, we study neighborhoods for vertices of graphs with length that at most 2 edges. A new binary relation induced from a simple graph is defined and more properties of star definability which based on reflexive and transitive relation will be discussed. So, we investigate N-star lower and N-star upper approximations, for every subset B of a set of vertices V of a graph G. The relationship between the star set and independent set will be discussed.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details
1 Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt.
2 Mathematics Department - Faculty of Science, Damietta University, Damietta, Egypt.