IMPORTANT COVID-19 UPDATES

9780134689555

Discrete Mathematics with Graph Theory (Classic Version)

by ;
  • ISBN13:

    9780134689555

  • ISBN10:

    0134689550

  • Edition: 3rd
  • Format: Paperback
  • Copyright: 2017-03-20
  • Publisher: PEARSO

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
  • Buyback Icon We Buy This Book Back!
    In-Store Credit: $32.81
    Check/Direct Deposit: $31.25
    PayPal: $31.25
List Price: $106.65 Save up to $77.30
  • Rent Book $29.35
    Add to Cart Free Shipping Icon Free Shipping

    TERM
    PRICE
    DUE
    IN STOCK USUALLY SHIPS IN 24 HOURS.
    HURRY! ONLY 1 COPY IN STOCK AT THIS PRICE
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

Supplemental Materials

What is included with this book?

Summary

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.


Far more “user friendly” than the vast majority of similar books, this text is truly written with the “beginning” reader in mind.  The pace is tight, the style is light, and the text 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).

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

Rewards Program

Write a Review