The book provides a solid introduction to graph theory for the beginner, and has the advantage of still being of use to those without a strong mathematical background. The book covers all the basic terms and theories, and then tackles the classic problems: traveling salesmen, map colouring, who you should marry (!) etc. It provides detailed proofs for those who like that kind of thing, while still being a accessible book for those who want to skip the reasoning to move straight onto the algorithms for solving problems. It does, however, have some down-points. The later chapters rely quite heavily on ideas introduced during the more complex exercises. Although this is pointed out by the author, it wouldn't help those wanting to dip into sections. In addition, the book flits somewhat rapidly through flow calculations and could also do with updating to include some mention of small-world theory in order to really cover all that's likely to be interesting to a beginner. Otherwise a sound introduction for a broad audience.
This book is printed upon good quality paper in a strong binding. The text is of a good size so those who need spectacles to read can manage better and its easier to read when holding the book.
*Briefly, what is graph Theory?
G. T. is a way of displaying relationships within information elements using finite sets of nodes and lines (edges). You may have heard of some of these such as the famous 'konigsberg' bridges problem, and the London underground.
* Items explored
At this level of studies, the following are discussed more widely, isomorphic graphs ( p. 9) that vary between relationships, chemical molecules, optimising of travel networks ' the Minimum Connector Problem' (p. 52-53) and 'Kirchoff' laws '/ Euler methods within small electrical networks (p. 54) operated with tree diagrams / planar graphs and network flows. These are really useful and well explained.
* Items discussed in In more depth
In more rewarding manner it concentrates upon 'Chinese Postman Problem' (p. 38 - 40) and 'Travelling Salesman Problem' (p. 41- 42 ) , deep or broad data searches, 'Weighted Activity Networks (Digraph) ' (p. 100 - 105). These are quite interesting to follow through and see how they operate. Basically, its the shortest way around a map of a place without repeating a road already used.
* important items in depth
A later part is to explore how to stop maps of countries having the same bordering colours, Chapter 6, (p. 81 -99). These methods have been applied in undergraduate programming studies to compose code and simulate the actions of road mapping software. If you read these book at these points makes its very clear and revealing explanation of the concepts. The coding for this is not in this book, however.
Its a nice book on a new - to - me topic. Its classed as an easier mathematical topic as so its needs less prerequisite studies than some other topics. Its still a satisfying easier topic at this undergraduate level. There are many examples questions and worked versions in the back pages of the book.