超图 hypergraph.docVIP

Hypergraph(超图) An example hypergraph, with X?= {v1,v2,v3,v4,v5,v6,v7}?and E?= {e1,e2,e3,e4} =?{{v1,v2,v3},{v2,v3},?{v3,v5,v6},?{v4}}. in?mathematics, a?hypergraph?is a generalization of a?graph, where anedge?can connect any number of?vertices. Formally, a hypergraph?H?is a pairH?= (X,E)?where?X?is a set of elements, called?nodes?or?vertices, and?Eis a set of non-empty subsets of?X?called?hyperedges?or?links. Therefore,E?is a subset of?, where??is the?power set?of?X. While graph edges are pairs of nodes, hyperedges are arbitrary sets of nodes, and can therefore contain an arbitrary number of n