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

For courses in Discrete Mathematics.

A modern classic

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 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).

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

Hallmark features of this title

• A friendly, conversational, humorous style with emphasis on writing and critical-thinking skills.
• More than 150Pauses (short questions) inserted at strategic points. Full solutions to Pauses are included at the end of each section.
• More than 300 worked examples and 3500 exercises. The problem sets are carefully graded by level of difficulty.
• 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.

New and updated features of this title

• The former Chapter 1 (“Proofs”) has been split into 2 chapters, the first mainly expository on proofs, the second focused on logic (truth tables, propositions).
• 2 sections on probability (2.4 and 2.5); a number of new computer science applications.
• 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.