Discrete Mathematics with Graph Theory (Classic Version), 3rd Edition
©2018 |Pearson | Available
Edgar Goodaire
Michael Parmenter
©2018 |Pearson | Available
Introducing Pearson+ 1500+ eTexts and study tools, all in one place. Subscriptions starting at $9.99/month.
K-12 educators: This link is for individuals purchasing with credit cards or PayPal only. Contact your Savvas Learning Company Account General Manager for purchase options.
This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. Please visit www.pearsonhighered.com/math-classics-series for a complete list of titles.
This product is part of the following series. Click on a series title to see the full list of products in the series.
• A friendly, conversational, humorous style – Makes this top seller stimulating and engaging for the reader.
• More than 150 Pauses (short questions) – Inserted at strategic points. Full solutions to Pauses are included at the end of each section.
• Emphasis on writing and critical-thinking skills.
• More than 300 worked examples and 3500 exercises. The problem sets are carefully graded by level of difficulty.
• A FREE Student Solutions Manual is built into the back of the text.
• Topics in discrete math are used as a vehicle for teaching proofs.
• An unusually strong emphasis on graph theory, incorporating its coverage throughout six chapters.
• A glossary of definitions and a list of symbols and notation.
• The former Chapter 1 (“Proofs”) has been split into two chapters, the first mainly expository on proofs, the second focused on logic (truth tables, propositions).
• Two sections on probability (2.4 and 2.5).
• Material on depth-first search which previously comprised an entire (very short) chapter has been moved to an earlier chapter where it fits more naturally.
• Section 11.3 on RNA chains has been rewritten to include a new (and easier) algorithm for the recovery of an RNA chain from its complete enzyme digest.
• True/false questions (with all answers in the back of the book) have been added to every section.
• An additional 900 exercises; complete solutions to an additional 200 exercises in the back of the book.
• Many new exercises on mathematical induction, which is now one of the strongest, basic presentations available.
• An appendix on matrices.
• A number of new computer science applications.
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 TheoremPearson offers affordable and accessible purchase options to meet the needs of your students. Connect with us to learn more.
K12 Educators: Contact your Savvas Learning Company Account General Manager for purchase options. Instant Access ISBNs are for individuals purchasing with credit cards or PayPal.
Savvas Learning Company is a trademark of Savvas Learning Company LLC.
Goodaire & Parmenter
©2018  | Pearson  | 592 pp
We're sorry! We don't recognize your username or password. Please try again.
The work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning.
You have successfully signed out and will be required to sign back in should you need to download more resources.