Discrete mathematics with graph theoryMaterial type: TextPublication details: New Delhi: Prentice-Hall, 2002Edition: 2nd edDescription: xix, 465p. : illustrationsISBN: 9780130920003; 0130920002 ; 9788120321212 ; 8120321219 Subject(s): Mathematics | Computer science -- MathematicsDDC classification: 512
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
|Reference Books||Main Library Reference||Reference||512 GOO (Browse shelf(Opens below))||Available||008358|
Browsing Main Library shelves, Shelving location: Reference, Collection: Reference Close shelf browser (Hides shelf browser)
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.
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.