Covering Walks in Graphs - SpringerBriefs in Mathematics (Paperback)
  • Covering Walks in Graphs - SpringerBriefs in Mathematics (Paperback)
zoom

Covering Walks in Graphs - SpringerBriefs in Mathematics (Paperback)

(author), (author)
£44.99
Paperback 110 Pages / Published: 25/01/2014
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781493903047
Number of pages: 110
Weight: 2226 g
Dimensions: 235 x 155 x 7 mm
Edition: 2014 ed.


MEDIA REVIEWS

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)

You may also be interested in...

Problems in Probability
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Proofs from THE BOOK
Added to basket
Discrete Mathematics
Added to basket
Introduction to Graph Theory
Added to basket
Combinatorial Optimization
Added to basket
Modern Graph Theory
Added to basket
Proofs and Fundamentals
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.