Affiliation:
1. Department of Mathematics, Government College Women University, Sialkot, Pakistan
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.
Reference52 articles.
1. Cartesian product of hypergraphs: properties and algorithms
2. On the direct product of hypergraphs;W. Dörfler;Ars Combinatoria,1982
3. Hamiltonicity of products of hypergraphs;M. Sonntag;Annals of Discrete Mathematics,1992
4. Handbook of product graphs;R. Hammack,2011
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献