DIPLAMO IN FUZZY HYPERGRAPH THEORY

In mathematics, a hypergraph is a speculation of a chart wherein an edge can join any number of vertices. While chart edges are 2-component subsets of hubs, hyperedges are discretionary arrangements of hubs, and can in this manner contain a subjective number of hubs. In any case, it is regularly alluring to think about hypergraphs where all hyperedges have a similar cardinality; a k-uniform hypergraph is a hypergraph with the end goal that all its hyperedges have size k. (At the end of the da