New rough approximations for n-cycles and n-paths

Silvia M. Sanahuja

Applied Mathematics and Computation, 2016, vol. 276, issue C, 96-108

Abstract: In this paper, we continue the study of a finite simple undirected graph through the rough set techniques introduced by Pawlak in the early 80’s. In this sense, we focus on the Boolean information system induced from a circle or a line graph with n vertices and, for such graphs, we provide a complete description of the rough membership function and some results on the positive regions and the attribute dependency function.

Keywords: Boolean information system; Rough sets; Simple graph; Rough membership function; Positive regions; Attribute dependency function (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315015544
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:276:y:2016:i:c:p:96-108

DOI: 10.1016/j.amc.2015.11.052

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().