NIST

hyperedge

(definition)

Definition: A connection between any number of vertices of a hypergraph.

Formal Definition: A hyperedge is a set of vertices of a hypergraph.

Aggregate parent (I am a part of or used in ...)
hypergraph.

See also edge, graph, directed graph, undirected graph, weighted graph.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 3 November 2005.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "hyperedge", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 3 November 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/hyperedge.html