| 000 | 00956 a2200193 4500 | ||
|---|---|---|---|
| 003 | Nust | ||
| 005 | 20230704120734.0 | ||
| 020 | _a8120321219 | ||
| 040 | _cNust | ||
| 082 | _a511,GOO | ||
| 100 |
_aG.Goodaire, Edgar _9113296 |
||
| 245 |
_aDiscrete Mathematics : _bwith Graph Theory / _cEdgar G.Goodaire, Michael M. Parmenter |
||
| 250 | _a2nd Edition | ||
| 260 |
_aPrentice Hall _bIndia _c2003 |
||
| 300 | _a545 p | ||
| 505 | _aYes , there are proofs (Page-1), Sets and Relations (Page-37), Functions (Page-71), The Integers (Page-97), Induction and Recursion (Page-149), Principles of Counting (Page-187), Permuatation and Combinations (Page-211), Algorithms (Page-239), Graphs (Page-277), Paths and Cicuits (Page-303), Applications of Paths and circuits (Page-337), Trees (Page-367), Depth First search and applications (Page-399), Planar Graphs and Coloring (Page-413), The Max Flow (Page-441). | ||
| 650 | _aGraph Theory | ||
| 942 |
_2ddc _cBKB |
||
| 999 |
_c217727 _d217727 |
||