Hafnian
In mathematics, the hafnian of an adjacency matrix of a graph is the number of perfect matchings in the graph. It was so named by Eduardo R. Caianiello "to mark the fruitful period of stay in Copenhagen (Hafnia in Latin)." The hafnian of a 2n × 2n symmetric matrix is computed as where is the symmetric group on [2n]. Equivalently, where is the set of all 1-factors (perfect matchings) on the complete graph , namely the set of all ways to partition the set into subsets of size .
Hafnian
In mathematics, the hafnian of an adjacency matrix of a graph is the number of perfect matchings in the graph. It was so named by Eduardo R. Caianiello "to mark the fruitful period of stay in Copenhagen (Hafnia in Latin)." The hafnian of a 2n × 2n symmetric matrix is computed as where is the symmetric group on [2n]. Equivalently, where is the set of all 1-factors (perfect matchings) on the complete graph , namely the set of all ways to partition the set into subsets of size .
has abstract
In mathematics, the hafnian of ...... the set into subsets of size .
@en
Wikipage page ID
49,270,505
page length (characters) of wiki page
Wikipage revision ID
985,384,320
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
type
comment
In mathematics, the hafnian of ...... the set into subsets of size .
@en
label
Hafnian
@en