Hypergraph

Common card · No. 248867

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} . Each of these pairs ( D , C ) ∈ E {\displaystyle (D,C)\in E} is called an edge or hyperedge; the vertex subset D {\displaystyle D} is known as its tail or domain, and C {\displaystyle C}...

Read on Wikipedia · Image Pgdx, CC BY-SA 3.0