Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`Hypergraph`
CanonicalHypergraph  |
|
| | ||||
| | |||||
▪
The canonical form is a whose vertices are the consecutive integers 1, 2, …, with hyperedges rewritten accordingly and sorted into a canonical order.
▪
▪
The edge symmetry of hg is preserved in the canonical form; by default, all other annotations and styling options are dropped.
▪
The following options can be given:
▪
▪
| | canonicalize a graph encoding of the hypergraph with | | | same as | | | reduce repeated edges of the graph encoding before canonicalizing | | | exhaustive combinatorial search |
"Graph"
"MultiGraph"
"Combinatorial"
▪
The method falls back to the combinatorial search when cannot handle the graph encoding; the method uses the resource function directly.
"Combinatorial"
FindCanonicalHypergraphIsomorphism
▪
Canonical forms computed with different settings are always isomorphic, but need not be identical.
▪
With , vertex and edge annotations, including styles, are transferred to the relabeled vertices and hyperedges of the canonical form.
Examples
(12)
Basic Examples
(2)
Find the canonical form of a hypergraph:
In[1]:=
chg=
[{{a,b},{b,c},{c,a,d}}]
 | CanonicalHypergraph |
 | Hypergraph |
Out[1]=
Its vertices are relabeled by consecutive integers:
In[2]:=
EdgeList[chg]
Out[2]=
{{1,3},{1,4},{2,3,4}}
_________________________________________________________________________________________________________________
Isomorphic hypergraphs have identical canonical forms:
In[1]:=
| CanonicalHypergraph |
| Hypergraph |
| CanonicalHypergraph |
| Hypergraph |
Out[1]=
True
Scope
(4)
Options
(2)
Properties & Relations
(3)
Possible Issues
(1)
 |
|
""