Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

About shortest paths between nodes of the graph Hanoi

From MaRDI portal
Publication:3569847
Jump to:navigation, search

zbMATH Open1212.05067MaRDI QIDQ3569847FDOQ3569847


Authors: S. P. Novikov Edit this on Wikidata


Publication date: 22 June 2010





Recommendations

  • scientific article; zbMATH DE number 6280003
  • Shortest Paths in the Tower of Hanoi Graph and Finite Automata
  • Shortest paths between regular states of the Tower of Hanoi
  • Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
  • Towers of hanoi graphs


zbMATH Keywords

regular nodesthe graph Hanoi


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)



Cited In (1)

  • Title not available (Why is that?)





This page was built for publication: About shortest paths between nodes of the graph Hanoi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569847)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3569847&oldid=16964763"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 02:11. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki