Discrete Mathematics with Graph Theory (Classic Version), 3rd edition

Published by Pearson (March 1, 2023) © 2023

  • Edgar Goodaire
  • Michael Parmenter

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

In this eTextbook — More ways to learn

  • More flexible. Start learning right away, on any device.
  • More supportive. Get AI explanations and practice questions (select titles).
  • More interactive. Bring learning to life with audio, videos, and diagrams.
  • More memorable. Make concepts stick with highlights, search, notes, and flashcards.
  • More understandable. Translate text into 100+ languages with one tap.

Title overview

Far more user friendly than the vast majority of similar books, Discrete Mathematics with Graph Theory, 3rd Edition is truly written with the beginning reader in mind. The pace is tight, the style is light, and it emphasizes theorem proving throughout. The authors emphasize active reading, a skill vital to success in learning how to think mathematically (and write clean, error-free programs).

This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price.

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

Need help?Get in touch