01278nam a2200217 a 4500020001800000020001600018020001900034020001600053082001300069100002300082245004300105250001200148260003800160300003500198500002000233505042800253520029800681650001700979650003700996700002701033 a9780130920003 a0130920002 a9788120321212 a8120321219 a512bGOO aGoodaire, Edgar G. aDiscrete mathematics with graph theory a2nd ed. aNew Delhi:bPrentice-Hall,c2002. axix, 465p. :billustrations ; aIncludes Index. a 1. 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. a
For courses in Discrete Mathematics. Examples and exercises integrated throughout each chapter serve to pique student interest and bring clarity to even the most complex concepts. Above all, the book is designed to engage students in the interesting, applicable facets of modern mathematics. aMathematics. aComputer science -- Mathematics. aParmenter, Michael M.