About: Hanoi graph

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

In graph theory and recreational mathematics, the Hanoi graphs are undirected graphs whose vertices represent the possible states of the Tower of Hanoi puzzle, and whose edges represent allowable moves between pairs of states.

Property Value
dbo:abstract
  • In graph theory and recreational mathematics, the Hanoi graphs are undirected graphs whose vertices represent the possible states of the Tower of Hanoi puzzle, and whose edges represent allowable moves between pairs of states. (en)
  • 在图论和娛樂數學,河內圖是一種無向圖,它的頂點代表河內塔謎題的可能狀態,而它的邊代表兩個狀態間,可行的移動。 (zh)
dbo:thumbnail
dbo:wikiPageID
  • 58619302 (xsd:integer)
dbo:wikiPageLength
  • 6909 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1071399363 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In graph theory and recreational mathematics, the Hanoi graphs are undirected graphs whose vertices represent the possible states of the Tower of Hanoi puzzle, and whose edges represent allowable moves between pairs of states. (en)
  • 在图论和娛樂數學,河內圖是一種無向圖,它的頂點代表河內塔謎題的可能狀態,而它的邊代表兩個狀態間,可行的移動。 (zh)
rdfs:label
  • Hanoi graph (en)
  • 河內圖 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
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