Covering Walks in Graphs (SpringerBriefs in Mathematics) - Softcover

Buch 37 von 155: SpringerBriefs in Mathematics

Fujie, Futaba

 
9781493903047: Covering Walks in Graphs (SpringerBriefs in Mathematics)
Softcover
ISBN 10: 1493903047 ISBN 13: 9781493903047
Verlag: Springer, 2014

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Críticas

From the book reviews:

“Fujie (Nagoya Univ., Japan) and Zhang (Western Michigan Univ.) broadly survey many similar statements, some theorems, and some conjectures in a manner clear enough for beginners and thorough enough for experts. ... Summing Up: Recommended. Upper-division undergraduates and above.” (D. V. Feldman, Choice, Vol. 52 (3), November, 2014)

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2014
Sprache
Englisch
ISBN 10 
1493903047
ISBN 13 
9781493903047
Einband
Tapa blanda
Anzahl der Seiten
124
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9781493903061: Covering Walks in Graphs

Vorgestellte Ausgabe

ISBN 10:  1493903063 ISBN 13:  9781493903061
Verlag: Springer, 2014
Softcover