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`
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
[
h
g
1
,
h
g
2
,
…
]
g
i
v
e
s
t
h
e
h
y
p
e
r
g
r
a
p
h
w
h
o
s
e
v
e
r
t
i
c
e
s
a
r
e
t
h
e
u
n
i
o
n
o
f
t
h
e
v
e
r
t
i
c
e
s
o
f
h
g
1
,
h
g
2
,
…
a
n
d
w
h
o
s
e
h
y
p
e
r
e
d
g
e
s
a
r
e
t
h
o
s
e
c
o
m
m
o
n
t
o
a
l
l
o
f
t
h
e
a
r
g
u
m
e
n
t
s
,
w
i
t
h
m
u
l
t
i
p
l
i
c
i
t
y
t
h
e
p
r
o
d
u
c
t
o
f
t
h
e
i
r
m
u
l
t
i
p
l
i
c
i
t
i
e
s
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
backs
N
o
n
C
o
m
m
u
t
a
t
i
v
e
M
u
l
t
i
p
l
y
on
H
y
p
e
r
g
r
a
p
h
objects, so
h
g
1
\
[
N
o
n
C
o
m
m
u
t
a
t
i
v
e
M
u
l
t
i
p
l
y
]
h
g
2
and
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
[
h
g
1
,
h
g
2
]
are the same operation.
▪
A hyperedge that appears
𝑘
1
times in
hg1
and
𝑘
2
times in
hg2
appears
𝑘
1
𝑘
2
times in the product; a hyperedge missing from either argument does not appear in the product at all.
▪
For more than two arguments, the product is computed by folding
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
[
h
g
1
,
h
g
2
]
pairwise over the arguments.
Examples
(
5
)
Basic Examples
(
2
)
Take the Hadamard product of two hypergraphs that share an edge:
I
n
[
1
]
:
=
E
d
g
e
L
i
s
t
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
H
y
p
e
r
g
r
a
p
h
[
{
{
1
,
2
}
,
{
2
,
3
}
}
]
,
H
y
p
e
r
g
r
a
p
h
[
{
{
1
,
2
}
,
{
1
,
2
}
}
]
O
u
t
[
1
]
=
{
{
1
,
2
}
,
{
1
,
2
}
}
The shared edge
{
1
,
2
}
appears once in the first hypergraph and twice in the second, so it appears twice in the product;
{
2
,
3
}
, present only in the first argument, is dropped.
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
_
H
y
p
e
r
g
r
a
p
h
H
a
d
a
m
a
r
d
P
r
o
d
u
c
t
backs
N
o
n
C
o
m
m
u
t
a
t
i
v
e
M
u
l
t
i
p
l
y
, so multiplying two hypergraphs gives the same result:
I
n
[
1
]
:
=
E
d
g
e
L
i
s
t
H
y
p
e
r
g
r
a
p
h
[
{
{
1
,
2
}
,
{
2
,
3
}
}
]
*
*
H
y
p
e
r
g
r
a
p
h
[
{
{
1
,
2
}
,
{
1
,
2
}
}
]
O
u
t
[
1
]
=
{
{
1
,
2
}
,
{
1
,
2
}
}
S
c
o
p
e
(
3
)
S
e
e
A
l
s
o
H
y
p
e
r
g
r
a
p
h
U
n
i
o
n
▪
H
y
p
e
r
g
r
a
p
h
▪
E
d
g
e
M
u
l
t
i
p
l
i
c
i
t
y
▪
E
d
g
e
L
i
s
t
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
"
"