Covering Walks in Graphs
Series: SpringerBriefs in Mathematics;
- Publisher's listprice EUR 53.49
-
22 690 Ft (21 609 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 1 815 Ft off)
- Discounted price 20 874 Ft (19 880 Ft + 5% VAT)
22 690 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2014
- Publisher Springer
- Date of Publication 25 January 2014
- Number of Volumes 1 pieces, Book
- ISBN 9781493903047
- Binding Paperback
- No. of pages110 pages
- Size 235x155 mm
- Weight 2226 g
- Language English
- Illustrations 26 Illustrations, black & white; 11 Illustrations, color 0
Categories
Short description:
a
MoreLong description:
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.
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) MoreTable of Contents:
1. Eulerian Walks.- 2. Hamiltonian Walks.- 3. Traceable Walks.- References.- Index.
More
Covering Walks in Graphs
Subcribe now and receive a favourable price.
Subscribe
22 690 HUF
