Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
Hypergraph
Guides
Hypergraph Functionality
Tech Notes
Hypergraph Rewriting
Symbols
AdjacencyHypergraph
AdjacencyTensor
CanonicalHypergraph
CanonicalHypergraphRule
ConnectedHypergraphQ
CyclicEdge
EdgeListTagged
EdgeMultiplicity
EdgeSymmetry
EnumerateHypergraphRules
EnumerateHypergraphs
EnumerateOrderedHypergraphs
EnumerateWolframModelRules
HighlightRule
HyperedgeList
Hyperedge
Hyperedges
HyperedgesQ
Hypergraph3D
HypergraphArityReduce
HypergraphDraw
HypergraphEmbedding
HypergraphHadamardProduct
HypergraphIncidenceMatrix
HypergraphIncidence
HypergraphInsertionBracketDegree
HypergraphInsertionBracket
HypergraphInsertion
HypergraphLargeQ
Hypergraph
HypergraphQ
HypergraphRuleDraw
HypergraphRule
HypergraphRuleQ
HypergraphToGraph
HypergraphTransitionMatrix
HypergraphUnion
HypermatrixGraph
Hypermatrix
HypermatrixQ
IncidenceHypergraph
IsomorphicHypergraphQ
KoszulSign
LinkedHypergraph
OrderedHypergraphToGraph
RandomAllHypergraph
RandomConnectedHypergraph
RandomHypergraph
RandomHypergraphRule
SetHypergraphSummaryThresholds
SimpleHypergraph
SimpleHypergraphPlot3D
SimpleHypergraphPlot
SimpleHypergraphQ
ToLabeledEdges
ToLabeledPatternEdges
ToOrderedHypergraph
ToPatternRules
WolframInstitute`Hypergraph`
C
y
c
l
i
c
E
d
g
e
C
y
c
l
i
c
E
d
g
e
[
v
1
,
v
2
]
r
e
p
r
e
s
e
n
t
s
t
h
e
h
y
p
e
r
e
d
g
e
{
v
1
,
v
2
}
w
i
t
h
c
y
c
l
i
c
e
d
g
e
s
y
m
m
e
t
r
y
,
g
i
v
e
n
i
n
t
h
e
e
d
g
e
l
i
s
t
p
a
s
s
e
d
t
o
H
y
p
e
r
g
r
a
p
h
.
C
y
c
l
i
c
E
d
g
e
[
v
1
,
v
2
,
t
a
g
]
r
e
p
r
e
s
e
n
t
s
t
h
e
s
a
m
e
h
y
p
e
r
e
d
g
e
,
t
a
g
g
e
d
w
i
t
h
t
a
g
.
C
y
c
l
i
c
E
d
g
e
[
{
v
1
,
…
,
v
k
}
]
r
e
p
r
e
s
e
n
t
s
t
h
e
k
-
a
r
y
h
y
p
e
r
e
d
g
e
{
v
1
,
…
,
v
k
}
w
i
t
h
c
y
c
l
i
c
e
d
g
e
s
y
m
m
e
t
r
y
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
C
y
c
l
i
c
E
d
g
e
is one of three heads
H
y
p
e
r
g
r
a
p
h
recognizes as edge-symmetry markers in an edge specification:
D
i
r
e
c
t
e
d
E
d
g
e
gives
"
O
r
d
e
r
e
d
"
symmetry,
U
n
d
i
r
e
c
t
e
d
E
d
g
e
gives
"
U
n
o
r
d
e
r
e
d
"
symmetry (the full symmetric group on the edge's vertices), and
C
y
c
l
i
c
E
d
g
e
gives
"
C
y
c
l
i
c
"
symmetry (the cyclic group generated by rotating the vertex list).
▪
The cyclic group of a
k
-ary edge has
k
elements, the identity and its
k - 1
nontrivial rotations; for
k
= 2 this coincides with
"
U
n
o
r
d
e
r
e
d
"
symmetry.
▪
Outside an edge specification,
C
y
c
l
i
c
E
d
g
e
carries no evaluation rules of its own and remains an unevaluated symbolic expression, the same way
D
i
r
e
c
t
e
d
E
d
g
e
and
U
n
d
i
r
e
c
t
e
d
E
d
g
e
do.
▪
E
d
g
e
S
y
m
m
e
t
r
y
reports
"
C
y
c
l
i
c
"
for a hyperedge specified with
C
y
c
l
i
c
E
d
g
e
;
H
y
p
e
r
e
d
g
e
L
i
s
t
reconstructs it as a
H
y
p
e
r
e
d
g
e
tagged
"
C
y
c
l
i
c
"
.
Examples
(
5
)
Basic Examples
(
1
)
Build a hypergraph with a cyclic ternary hyperedge:
I
n
[
1
]
:
=
h
g
=
H
y
p
e
r
g
r
a
p
h
C
y
c
l
i
c
E
d
g
e
[
{
1
,
2
,
3
}
]
O
u
t
[
1
]
=
Its edge symmetry is reported as
"
C
y
c
l
i
c
"
:
I
n
[
2
]
:
=
E
d
g
e
S
y
m
m
e
t
r
y
[
h
g
]
O
u
t
[
2
]
=
{
{
C
y
c
l
e
s
[
{
}
]
,
C
y
c
l
e
s
[
{
{
1
,
2
,
3
}
}
]
,
C
y
c
l
e
s
[
{
{
1
,
3
,
2
}
}
]
}
}
The full edge symmetry expands into the 3 elements of the cyclic group, the identity and the two nontrivial rotations:
I
n
[
3
]
:
=
h
g
[
"
F
u
l
l
E
d
g
e
S
y
m
m
e
t
r
y
"
]
O
u
t
[
3
]
=
{
{
C
y
c
l
e
s
[
{
}
]
,
C
y
c
l
e
s
[
{
{
1
,
2
,
3
}
}
]
,
C
y
c
l
e
s
[
{
{
1
,
3
,
2
}
}
]
}
}
S
c
o
p
e
(
2
)
P
r
o
p
e
r
t
i
e
s
&
R
e
l
a
t
i
o
n
s
(
2
)
S
e
e
A
l
s
o
H
y
p
e
r
e
d
g
e
s
▪
E
d
g
e
S
y
m
m
e
t
r
y
▪
H
y
p
e
r
g
r
a
p
h
T
o
G
r
a
p
h
▪
H
y
p
e
r
e
d
g
e
▪
H
y
p
e
r
g
r
a
p
h
R
e
l
a
t
e
d
G
u
i
d
e
s
▪
H
y
p
e
r
g
r
a
p
h
F
u
n
c
t
i
o
n
a
l
i
t
y
"
"