Concept

# Hypergraph

Summary
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), where X is a set of elements called nodes, vertices, points, or elements and E is a set of pairs of subsets of X. Each of these pairs (D,C)\in E is called an edge or hyperedge; the vertex subset D is known as its tail or domain, and C as its head or codomain. The order of a hypergraph (X,E) is the number of vertices in X. The size of the hypergraph is the number of edges in E. The order of an edge e=(D,C) in a directed hypergraph is |e| = (|D|,|C|): that is, the number of vertices in its tail followed by the number of vertices in its head. The definition above generalizes from a directed graph t
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications

Related people

Related units

Related concepts

Related courses

Related lectures