A Theoretical Investigation Based on the Rough Approximations of Hypergraphs. (7th March 2022)

• Record Type: Journal Article
• Authors: Sarwar, Musavarah
• Other Names: Ali Gohar Academic Editor.
• Is Part Of: Journal of mathematics. Volume 2022(2022)
• Publication Date: 2022-03-07
• Subjects: Mathematics -- Periodicals; Mathematics; Periodicals; 510
• DOI: 10.1155/2022/1540004
• Languages: English
• ISSNs: 2314-4629

Abstract

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.