Adopting a user-friendly, conversationalβand at times humorousβstyle, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader
Discrete mathematics with graph theory
β Scribed by Edgar G Goodaire; Michael M Parmenter
- Publisher
- Prentice Hall
- Year
- 2002
- Tongue
- English
- Leaves
- 557
- Edition
- 2nd ed
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
- Yes, There Are Proofs! 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. Depth-First Search and Applications. 14. Planar Graphs and Colorings. 15. The Max Flow--Min Cut Theorem. Solutions to Selected Exercises. Glossary. Index
π SIMILAR VOLUMES
<p><span>This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course. No formal prerequisites are needed to understand the text matter except a very reasonable background
<p><span>This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course. No formal prerequisites are needed to understand the text matter except a very reasonable background
Adopting a user-friendly, conversationalβand at times humorousβstyle, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader