[Image:Hypergraph.gif|right|frame| Sample of hypergraph: , . ]]In
mathematics, a hypergraph is a generalization of a
graph, where
edges can connect any number of
vertices. Formally, a hypergraph is a pair where is a set of elements, called nodes or vertices, and is a set of non-empty subsets of called hyperedges. Therefore, is a subset of , where is the
power set of . While graph edges are pairs of nodes, hyperedges are arbitrary sets of nodes, and can therefore contain an arbitrary number of nodes.
See more at Wikipedia.org...
Free Download Now!
