Discrete Mathematics with Graph Theory / Edition 3

Discrete Mathematics with Graph Theory / Edition 3

by Edgar G. Goodaire, Michael M. Parmenter
     
 

View All Available Formats & Editions

ISBN-10: 0131679953

ISBN-13: 9780131679955

Pub. Date: 06/24/2005

Publisher: Pearson

Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout. Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write

Overview

Far more "user friendly" than the vast majority of similar books, this volume is truly written with the unsophisticated reader in mind. The pace is leisurely, but the authors are rigorous and maintain a serious attitude towards theorem proving throughout. Emphasizes "Active Reading" throughout, a skill vital to success in learning how to write proofs. Offers two sections on probability (2.4 and 2.5). Moves material on depth-first search, which previously comprised an entire (very short) chapter, to an earlier chapter where it fits more naturally. Rewrites section on RNA chains to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest. Provides true/false questions (with all answers in the back of the book) in every section. Features an appendix on matrices. A useful reference for mathematics enthusiasts who want to learn how to write proofs.

Product Details

ISBN-13:
9780131679955
Publisher:
Pearson
Publication date:
06/24/2005
Series:
Featured Titles for Discrete Mathematics Series
Edition description:
REV
Pages:
592
Sales rank:
674,868
Product dimensions:
8.56(w) x 10.21(h) x 0.97(d)

Table of Contents

0. Yes, There Are Proofs!

1. Logic

2. Sets and Relations

3. Functions

4. The Integers

5. Induction and Recursion

6. Principles of Counting

7. Permutations and Combinations

8. Algorithms

9. Graphs

10. Paths and Circuits

11. Applications of Paths and Circuits

12. Trees

13. Planar Graphs and Colorings

14. The Max Flow -- Min Cut Theorem

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >