A Theoretical Investigation Based on the Rough Approximations of Hypergraphs

Musavarah Sarwar and Gohar Ali

Journal of Mathematics, 2022, vol. 2022, 1-19

Abstract: 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.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/1540004.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/1540004.xml (application/xml)

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:hin:jjmath:1540004

DOI: 10.1155/2022/1540004

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().