Skip to content
hypergraf
EntityQ840247· pop 28· linked from 286 articles

Also known as set system, hypergraphs

frame|An example of an undirected hypergraph, with X = \{v_1, v_2, v_3, v_4, v_5, v_6, v_7\} and E = \{e_1,e_2,e_3,e_4\} = \{\{v_1, v_2, v_3\}, \{v_2,v_3\}, \{v_3,v_5,v_6\}, \{v_4\}\}. This hypergraph has order 7 and size 4. Here, edges do not just connect two vertices but several, and are represented by colors. alt=PAOH visualization of a hypergraph|thumb|Alternative representation of the hypergraph reported in the figure above, called PAOH. Edges are vertical lines connecting vertices. V7 is an isolated vertex. Vertices are aligned to the left. The legend on the right shows the names of the

Wikidata facts

Image
Hypergraph-wikipedia.svg
Show 4 more facts
Commons category
Hypergraphs
ACM Classification Code (2012)
10003637
maintained by WikiProject
WikiProject Mathematics
Sources (2)

via Wikidata · CC0

Article · Svenska

En hypergraf är, inom grafteori, en generalisering av en graf, vars bågar kan binda samman ett godtyckligt antal noder.

Abstract from DBpedia / Wikipedia · CC BY-SA

Gallery (10)