| 書目名稱 | Covering Walks in Graphs |
| 編輯 | Futaba Fujie,Ping Zhang |
| 視頻video | http://file.papertrans.cn/240/239201/239201.mp4 |
| 概述 | Provides a comprehensive treatment on measures of Hamiltonicity and traversability in graphs.Contains intriguing open problems and conjectures on spanning walks in graphs.Describes new frame works for |
| 叢書名稱 | SpringerBriefs in Mathematics |
| 圖書封面 |  |
| 描述 | .Covering?Walks ?in Graphs. is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous K?nigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors?provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce inter |
| 出版日期 | Book 2014 |
| 關(guān)鍵詞 | Hamiltonian graph; spanning walk; traceable number; traversability in graphs; combinatorics |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4939-0305-4 |
| isbn_softcover | 978-1-4939-0304-7 |
| isbn_ebook | 978-1-4939-0305-4Series ISSN 2191-8198 Series E-ISSN 2191-8201 |
| issn_series | 2191-8198 |
| copyright | Futaba Fujie, Ping Zhang 2014 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 02:46
發(fā)表于 2025-3-21 19:22:16
