Amazon.com: Graph Theory (9780201027877): Frank Harry: Books

Sell Back Your Copy
For a $0.50 Gift Card
Trade in
Have one to sell? Sell yours here
Graph Theory
 
See larger image
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Graph Theory [Hardcover]

Frank Harry (Author)
3.8 out of 5 stars  See all reviews (4 customer reviews)


Available from these sellers.


Formats

Amazon Price New from Used from
Hardcover --  
Hardcover, 1969 --  
Paperback $77.14  

Book Description

1969
Graph theory serves as a mathematical model for any system involving a binary relation. Partly because of their diagrammatic representation, graphs have an intuitive and aesthetic appeal. Although there are many results in this field of an elementary nature, there is also an abundance of problems with enough combinatorial sublety to challenge the most sophisticated mathematician. Earlier versions of this book have been used since 1956 when regular courses on graph theory and combinatorial theory began in the Department of Mathematics at the University of Michigan. The various topics in the theory of graphs are presented in a logical order, indicating the historical background, and clarifying 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 occasionally mentioned. Exercises are included throughout the book.


Product Details

  • Hardcover: 274 pages
  • Publisher: Addison-Wesley Publishing Co. (1969)
  • Language: English
  • ISBN-10: 0201027879
  • ISBN-13: 978-0201027877
  • Product Dimensions: 9.1 x 5.9 x 0.8 inches
  • Shipping Weight: 1.2 pounds
  • Average Customer Review: 3.8 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #1,997,550 in Books (See Top 100 in Books)

 

Customer Reviews

4 Reviews
5 star:
 (2)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:
 (1)
 
 
 
 
 
Average Customer Review
3.8 out of 5 stars (4 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

23 of 26 people found the following review helpful:
4.0 out of 5 stars A class for theoretical math, but not applied math, June 4, 2001
By 
J Bowles (San Francisco, ca United States) - See all my reviews
(REAL NAME)   
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.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


12 of 24 people found the following review helpful:
5.0 out of 5 stars The absolute classic!, June 12, 1998
By A Customer
This is the abslolute classic in the field and a great introduction to this fascinating area of the discrete mathematics.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


3 of 34 people found the following review helpful:
5.0 out of 5 stars Clasical and Excellent, April 2, 1999
By A Customer
Good
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews


Only search this product's reviews



What Other Items Do Customers Buy After Viewing This Item?


Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

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

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!

Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category