Hypergraph

Generalization of graph theory

In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two vertices. Formally, a directed hypergraph is a pair ( X , E) {\displaystyle (X,E)} , where X {\displaystyle X} is a set of elements called nodes, vertices, points, or elements and E {\displaystyle E} is a set of pairs of subsets of X {\displaystyle X} .

From Wikipedia, under CC BY-SA. More on occurri.