Discrete Mathematics is one of the fastest growing areas in mathematics today with an ever-increasing number of courses in schools and universities. Graphs and Applications is based on a highly successful Open University course and the authors have paid particular attention to the presentation, clarity and arrangement of the material, making it ideally suited for independent study and classroom use. Includes a large number of examples, problems and exercises.
Graphs and Applications: An Introductory Approach
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
 Sell Back Your Copy for $19.81
Whether you buy it used on Amazon for $44.00 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $19.81.
Used Price$44.00
Trade-in Price$19.81
Price after
Trade-in$24.19 |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Frequently Bought Together
Editorial Reviews
Review
From the reviews: BULLETIN OF MATHEMATICS BOOKS "? very nice (as you might expect from Wilson) but very low level graph theory text?t even has a CD!"
Product Details
Would you like to update product info or give feedback on images?
|
More About the Authors
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
0 of 3 people found the following review helpful:
1.0 out of 5 stars
Graphs and Applications with CD-ROM,
By
Amazon Verified Purchase(What's this?)
This review is from: Graphs and Applications: An Introductory Approach (with CD-ROM) (Paperback)
While the inventory on these is very low. I wouldnt recommend buying it from this lot. I received my first order and it was missing the CD. Amazon was great at getting me a return label and another shipped out immediately to replace it. However, the second order came and it too was missing the CD:((( I ended up having to buy from the school bookstore so I would have the book and CD as advertised for my class:(
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
In this introductory chapter, we aim to give you some idea of what this book is about. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
octahedron graph, minimum connector problem, bound forx, rotating drum problem, way that adjacent vertices, handshaking lemma, next smallest weight, theorem for digraphs, vertex cutset, split into cycles, vertex decomposition, minimum bracing, above digraph, following digraphs, optimal connectivity, unlabelled graphs, unlabelled trees, assigned different colours, edge decomposition, simple connected graph, vertex colouring, edge colouring, associated digraph, rectangular framework, connected planar graph Key Phrases - Capitalized Phrases (CAPs): (learn more)
Repeat Steps, New York, John Wiley, Proof Let, Arthur Cayley, Leonhard Euler, Use Theorem, Definition Let, Definitions Let, London Underground, San Francisco, Use Open, Vertices Reached Directly, Academic Press, Clarendon Press, Hint First, Los Angeles, Proof There, Solve the Chinese New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
In this introductory chapter, we aim to give you some idea of what this book is about. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
octahedron graph, minimum connector problem, bound forx, rotating drum problem, way that adjacent vertices, handshaking lemma, next smallest weight, theorem for digraphs, vertex cutset, split into cycles, vertex decomposition, minimum bracing, above digraph, following digraphs, optimal connectivity, unlabelled graphs, unlabelled trees, assigned different colours, edge decomposition, simple connected graph, vertex colouring, edge colouring, associated digraph, rectangular framework, connected planar graph Key Phrases - Capitalized Phrases (CAPs): (learn more)
Repeat Steps, New York, John Wiley, Proof Let, Arthur Cayley, Leonhard Euler, Use Theorem, Definition Let, Definitions Let, London Underground, San Francisco, Use Open, Vertices Reached Directly, Academic Press, Clarendon Press, Hint First, Los Angeles, Proof There, Solve the Chinese New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 26
books:
See all 26 books this book cites
2
books
cite this book:
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel on page 346, and page 347
- Applied and Algorithmic Graph Theory by Gary Chartrand on page 346
- Applied Combinatorics by Alan Tucker on page 347
- Human Biology, Study Guide by Michael D. Johnson in Front Matter
- Introduction to Graph Theory by Gary Chartrand on page 346
See all 26 books this book cites
- Medical Image Analysis Methods (Electrical Engineering & Applied Signal Processing Series) by Lena Costaridou on page 392
- Innovative Approaches to Undergraduate Mathematics Courses Beyond Calculus by Richard J. Maher on page 37
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
