- Paperback: 288 pages
- Publisher: Westview Press; New Ed edition (30 Sep 1994)
- Language English
- ISBN-10: 0201410338
- ISBN-13: 978-0201410334
- Product Dimensions: 22.9 x 15.7 x 1.8 cm
- Average Customer Review: 5.0 out of 5 stars See all reviews (1 customer review)
- Amazon Bestsellers Rank: 1,451,324 in Books (See Top 100 in Books)
- See Complete Table of Contents
| ||||||||||||||||||||
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Plus, get an extra £5 Gift Certificate when you trade in books worth £10 or more before June 30, 2012. Visit the Books Trade-In Store for more details. |
Product details |
Product Description
Product Description
An effort has been made to present the various topics in the theory of graphs in a logical order, to indicate the historical background, and to clarify the exposition by including figures to illustrate concepts and results. In addition, there are three appendices which provide diagrams of graphs, directed graphs, and trees. The emphasis throughout is on theorems rather than algorithms or applications, which however are occaisionally mentioned.
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organise and find favourite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
1 of 1 people found the following review helpful
Format:Paperback
This is the abslolute classic in the field and a great introduction to this fascinating area of the discrete mathematics.
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
4 reviews
23 of 26 people found the following review helpful
A class for theoretical math, but not applied math
4 Jun 2001
Format:Paperback
I used this text in school, as a computer science student in a theoretical math class.
If you are looking for examples of computer algorithms, look elsewhere; the closest this will get you is to "existence proofs", which is showing that something (such as a hamiltonian cycle) exists in a graph that has thus-and-such number of points or edges, but not tell you which sequence of points/edges make up that something. (For example, a graph can be embedded in a plane unless there's a subgraph that looks like K(5) or K(3,3) inside it - this is in about chapter 5, and an important theorem. The text proves this, but doesn't tell you HOW to embed the graph in a plane.)
That said, this is an excellent book for theoretical mathematics. I understand that the first two chapters can be used as a high school math text, as an introduction to proofs, and agree that it would work well.
As a formal introduction to proving theorems, especially in a self-contained world (you don't need many prerequisites for this, like you do for a topology or analysis text), this is pretty swell.
So, to the person who said that he didn't like this because there weren't algorithms in the book: you can find those in the semiliterate computer science textbooks. (I would insist that the last four words of the previous sentence are redundant.)
Look here for mathematics.
12 of 24 people found the following review helpful
The absolute classic!
12 Jun 1998
Format:Paperback
This is the abslolute classic in the field and a great introduction to this fascinating area of the discrete mathematics.
3 of 34 people found the following review helpful
Clasical and Excellent
2 April 1999
Format:Paperback
Good
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
