Wolfram Cloud Resource Object

Paclet Resource

Home

Guides

Hypergraph Functionality

Symbols

AdjacencyHypergraph
AdjacencyTensor
EnumerateHypergraphs
HighlightRule
HyperMatrix
HyperMatrixGraph
Hypergraph
HypergraphDraw
HypergraphIncidenceMatrix
HypergraphRule
IncidenceHypergraph
SimpleHypergraphPlot

WolframInstitute`Hypergraph`

EnumerateHypergraphs

EnumerateHypergraphs [{{ m 1 , a 1 },{ m 2 , a 2 },...}]
	generates all simple connected hypergraphs of a given signature, with m 1 edges of arity a 1 , m 2 edges of arity a 2 etc.

EnumerateHypergraphs [signature,n]
	generate hypergraphs having up-to n vertices.

EnumerateHypergraphs [signature,{n}]
	generate hypergraph with exactly n vertices.

EnumerateHypergraphs [signature,vertexSpec,{connected,simple}]
	specify whether hypergraphs should be connected or/and simple .

Examples

(5)

Basic Examples

(5)

Generate all possible ways to have a single unary and two binary edges together:

In[1]:=

EnumerateHypergraphs

[{{1,1},{2,2}}]

Out[1]=



,



Generate all hypergraphs with a single edge of each arity up-to 3:

In[1]:=

EnumerateHypergraphs

[{{1,1},{1,2},{1,3}}]

Out[1]=



,



Enumerate hypergraphs with 3 binary edges:

In[1]:=

EnumerateHypergraphs

[{{3,2}}]

Out[1]=



,



Enumerate only up-to 3 vertices:

In[2]:=

EnumerateHypergraphs

[{{3,2}},3]

Out[2]=





Enumerate hypergraphs with 2 binary edges:

In[1]:=

EnumerateHypergraphs

[{{2,2}}]

Out[1]=





Include non-connected hypergraphs:

In[2]:=

EnumerateHypergraphs

[{{2,2}},{False,True}]

Out[2]=



,



Include connected and non-simple hypergraphs:

In[3]:=

EnumerateHypergraphs

[{{2,2}},{True,False}]

Out[3]=



,



Include both non-connected and non-simple:

In[4]:=

EnumerateHypergraphs

[{{2,2}},{False,False}]

Out[4]=



,



Specify symmetry of edges:

In[1]:=

EnumerateHypergraphs

[{{2,2}},"EdgeSymmetry""Ordered"]

Out[1]=



,



In[2]:=

EnumerateHypergraphs

[{{3,2}},"EdgeSymmetry""Ordered"]

Out[2]=



,

