Higher Ed. and Vocational >> Science and Mathematics >> Mathematics >> Mathematics


Discrete Mathematics with Graph Theory

Discrete Mathematics with Graph Theory

Author(s):
  • Edgar G. Goodaire
  • Michael M. Parmenter
    • Author: Edgar G. Goodaire
    • ISBN:9789353433017
    • 10 Digit ISBN:9353433010
    • Price:Rs. 680.00
    • Pages:592
    • Imprint:Pearson Education
    • Binding:Paperback
    • Status:Available


    Be the first to rate the book !!

    Far more &ldquouser friendly" than the vast majority of similar books, this text is truly written with the &ldquobeginning" 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 Content

    Chapter 1. Logic Chapter 2. Sets and Relations Chapter 3. Functions Chapter 4. The Integers Chapter 5. Induction and Recursion Chapter 6. Principles of Counting Chapter 7. Permutations and Combinations Chapter 8. Algorithms Chapter 9. Graphs Chapter 10. Paths and Circuits Chapter 11. Applications of Paths and Circuits Chapter 12. Trees Chapter 13. Planar Graphs and Colorings Chapter 14. The Max Flow -- Min Cut Theorem"

    Salient Features

    1. A friendly, conversational, humorous style – Makes this top seller stimulating and engaging for the reader. 2. More than 150 Pauses (short questions) – Inserted at strategic points. Full solutions to Pauses are included at the end of each section. 3. Emphasis on writing and critical-thinking skills. 4. More than 300 worked examples and 3500 exercises. The problem sets are carefully graded by level of difficulty. 5. A FREE Student Solutions Manual is built into the back of the text. 6. Topics in discrete math are used as a vehicle for teaching proofs. 7. An unusually strong emphasis on graph theory, incorporating its coverage throughout six chapters. 8. A glossary of definitions and a list of symbols and notation.