Home >  Term: hypergraph
hypergraph

A graph whose hyperedges connect two or more vertices. Formal Definition: A hypergraph G can be defined as a pair (V, E), where V is a set of vertices, and E is a set of hyperedges between the vertices. Each hyperedge is a set of vertices: E ⊆ ((u, v, ...) ∈ 2V). (Hyperedges are undirected.)

0 0

Creator

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.