《伊科斯的游戏》重访

The Mathematica journal Pub Date : 2010-02-05 DOI:10.3888/TMJ.11.3-1

E. Pegg

{"title":"《伊科斯的游戏》重访","authors":"E. Pegg","doi":"10.3888/TMJ.11.3-1","DOIUrl":null,"url":null,"abstract":"In 1857 Sir William Rowan Hamilton invented the Icosian game [1]. In a world based on the dodecahedral graph, a traveler must visit 20 cities, without revisiting any of them. Today, when the trip makes a loop through all the vertices of the graph, it is called a Hamiltonian tour (or cycle). When the first and last vertices in a trip are not connected, it is called a Hamiltonian path (or trail). The first image shown is a tour; the second is a path.","PeriodicalId":91418,"journal":{"name":"The Mathematica journal","volume":"11 1","pages":"310-314"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The Icosian Game, Revisited\",\"authors\":\"E. Pegg\",\"doi\":\"10.3888/TMJ.11.3-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 1857 Sir William Rowan Hamilton invented the Icosian game [1]. In a world based on the dodecahedral graph, a traveler must visit 20 cities, without revisiting any of them. Today, when the trip makes a loop through all the vertices of the graph, it is called a Hamiltonian tour (or cycle). When the first and last vertices in a trip are not connected, it is called a Hamiltonian path (or trail). The first image shown is a tour; the second is a path.\",\"PeriodicalId\":91418,\"journal\":{\"name\":\"The Mathematica journal\",\"volume\":\"11 1\",\"pages\":\"310-314\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Mathematica journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3888/TMJ.11.3-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Mathematica journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3888/TMJ.11.3-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

1857年，威廉·罗文·汉密尔顿爵士发明了伊科斯式游戏b[1]。在一个基于十二面体图的世界里，一个旅行者必须访问20个城市，而不能重访其中任何一个。今天，当行程通过图的所有顶点形成一个循环时，它被称为哈密顿巡回(或循环)。当行程中的第一个顶点和最后一个顶点不相连时，它被称为哈密顿路径(或轨迹)。第一张图片显示的是一个旅游;第二个是路径。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The Icosian Game, Revisited

In 1857 Sir William Rowan Hamilton invented the Icosian game [1]. In a world based on the dodecahedral graph, a traveler must visit 20 cities, without revisiting any of them. Today, when the trip makes a loop through all the vertices of the graph, it is called a Hamiltonian tour (or cycle). When the first and last vertices in a trip are not connected, it is called a Hamiltonian path (or trail). The first image shown is a tour; the second is a path.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The Mathematica journal

自引率

0.00%

发文量

期刊最新文献

Mixing Numbers and Unfriendly Colorings of Graphs Selected Financial Applications Coverage versus Confidence Numerical Contour Integration Unconditional Applicability of Lehmer’s Measure to the Two-Term Machin-like Formula for π