A Theoretical Investigation Based on the Rough Approximations of Hypergraphs
Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions. Rough graphs cannot be studied more effectively when the inexact and approximate relations among more than two objects are to be discussed. In t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/1540004 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Rough sets are a key tool to model uncertainty and vagueness using upper and lower approximations without predefined functions and additional suppositions. Rough graphs cannot be studied more effectively when the inexact and approximate relations among more than two objects are to be discussed. In this research paper, the notion of a rough set is applied to hypergraphs to introduce the novel concept of rough hypergraphs based on rough relations. The notions of isomorphism, conformality, linearity, duality, associativity, commutativity, distributivity, Helly property, and intersecting families are illustrated in rough hypergraphs. The formulae of 2-section, L2-section, covering, coloring, rank, and antirank are established for certain types of rough hypergraphs. The relations among certain types of products of rough hypergraphs are studied in detail. |
|---|---|
| ISSN: | 2314-4785 |