Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q25101392)
Watch
English
hafnian
given an adjacency matrix of a graph, the number of perfect matchings in the graph
In more languages
edit
Statements
named after
Copenhagen
0 references
defining formula
haf
(
A
)
=
1
n
!
2
n
∑
σ
∈
S
2
n
∏
j
=
1
n
A
σ
(
2
j
−
1
)
,
σ
(
2
j
)
{\displaystyle \operatorname {haf} (A)={\frac {1}{n!2^{n}}}\sum _{\sigma \in S_{2n}}\prod _{j=1}^{n}A_{\sigma (2j-1),\sigma (2j)}}
0 references
maintained by WikiProject
WikiProject Mathematics
0 references
different from
hafnium
1 reference
imported from Wikimedia project
English Wikipedia
Wikimedia import URL
https://en.wikipedia.org/w/index.php?title=Hafnian&oldid=985384320
Identifiers
Google Knowledge Graph ID
/g/11cjpx4qyn
0 references
nLab ID
hafnian
0 references
Sitelinks
Wikipedia
(1 entry)
edit
enwiki
Hafnian
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit