Condition for neighbourhoods induced by a covering to be equal to the covering itself
by Hua Yao; William Zhu
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 3, No. 3, 2014

Abstract: It is a meaningful issue that under what condition neighbourhoods induced by a covering are equal to the covering itself. In this paper, firstly, through defining some concepts, such as repeat degree and invariable covering, we present a necessary and sufficient condition for this issue. Secondly, we concentrate on the inverse issue of computing neighbourhoods by a covering, namely for a given arbitrary covering, whether or not there exists another covering such that the neighbourhoods induced by it is just the former covering. We present a necessary and sufficient condition for this issue as well. In a word, through the study on the two fundamental issues induced by neighbourhoods, we have gained a deeper understanding of the relationship between neighbourhoods and the covering which induces the neighbourhoods.

Online publication date: Tue, 29-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com