Covering Walks in Graphs
jan 2014 · Springer Science & Business Media
E-boek
110
Pagina's
reportBeoordelingen en reviews worden niet geverifieerd. Meer informatie
Over dit e-boek
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 interesting new results.
Dit e-boek beoordelen
Geef ons je mening.
Informatie over lezen
Smartphones en tablets
Installeer de Google Play Boeken-app voor Android en iPad/iPhone. De app wordt automatisch gesynchroniseerd met je account en met de app kun je online of offline lezen, waar je ook bent.
Laptops en computers
Via de webbrowser van je computer kun je luisteren naar audioboeken die je hebt gekocht op Google Play.
eReaders en andere apparaten
Als je wilt lezen op e-ink-apparaten zoals e-readers van Kobo, moet je een bestand downloaden en overzetten naar je apparaat. Volg de gedetailleerde instructies in het Helpcentrum om de bestanden over te zetten op ondersteunde e-readers.
