Discrete mathematics with graph theory / by Edgar G. Goodaire, Michael M. Parmenter.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Contents:
1. YES, THERE ARE PROOFS!
2. LOGIC
3. SETS AND RELATIONS
4. FUNCTIONS
5. THE INTEGERS
6. INDUCTION AND RECURSION
7. PRINCIPLES OF COUNTING
8. PERMUTATION AND COMBINATION
9. ALGORITHMS
9. GRAPHS
10. PATH AND CIRCUITS
11. APPLICATION OF PATHS AND CIRCUITS
12. TREES
13. PLANAR GRAPHS AND COLORING'S
14. THE MAX FLOW-MIN CUT THEOREM
Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
Namal Library Mathematics | 510 GOO-D 2011 3775 (Browse shelf (Opens below)) | Available | 0003775 |
Total holds: 0
Browsing Namal Library shelves, Shelving location: Mathematics Close shelf browser (Hides shelf browser)
![]() |
No cover image available |
![]() |
![]() |
![]() |
![]() |
![]() |
||
510 EPP-D 2018 10765 Discrete mathematics with applications / | 510 GAR-D 2011 10760 Discrete mathematics : proofs, structures, and applications / | 510 GCE- 1998 8782 G.C.E. 'O' level mathematics (syllabus D). | 510 GOO-D 2011 3775 Discrete mathematics with graph theory / | 510 GRA-C 1994 10628 Concrete mathematics : a foundation for computer science / | 510 GRA-L 2012 809 Logic and discrete mathematics : | 510 HAR-M 2018 10626 A mathematician's apology / |
Includes index.
1. YES, THERE ARE PROOFS!
2. LOGIC
3. SETS AND RELATIONS
4. FUNCTIONS
5. THE INTEGERS
6. INDUCTION AND RECURSION
7. PRINCIPLES OF COUNTING
8. PERMUTATION AND COMBINATION
9. ALGORITHMS
9. GRAPHS
10. PATH AND CIRCUITS
11. APPLICATION OF PATHS AND CIRCUITS
12. TREES
13. PLANAR GRAPHS AND COLORING'S
14. THE MAX FLOW-MIN CUT THEOREM
There are no comments on this title.