About: Hafnian

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 symmetric matrix is computed as where is the symmetric group on . 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 . The permanent and the hafnian are related as .

Property Value
dbo:abstract
  • 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 symmetric matrix is computed as where is the symmetric group on . 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 . The permanent and the hafnian are related as . (en)
dbo:wikiPageID
  • 49270505 (xsd:integer)
dbo:wikiPageLength
  • 2349 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1094716028 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • 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 symmetric matrix is computed as where is the symmetric group on . 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 . The permanent and the hafnian are related as . (en)
rdfs:label
  • Hafnian (en)
owl:differentFrom
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License