| 000 | 01918nam a2200481 a 4500 | ||
|---|---|---|---|
| 001 | 22136 | ||
| 005 | 20230423231104.0 | ||
| 008 | 110525s2006 xxum a000 0 eng d | ||
| 020 | _a0131679953 | ||
| 049 | _bPITLIB | ||
| 050 | 4 |
_aQA39.3 _b.G66 2006 |
|
| 100 | 1 |
_aGoodaire, Edgar G. _930879 |
|
| 245 | 1 | 0 |
_aDiscrete mathematics : _bwith graph theory / _cEdgar G. Goodaire, Michael M. Parmenter _h[book] |
| 250 | _a2nd ed. | ||
| 260 |
_aUpper Saddle River, N.J. : _bPrentice Hall, _cc2006. _92211 |
||
| 300 |
_a461 p. : _bill. |
||
| 449 | 0 | _a•x008– New Arrivals- May. 2011 | |
| 650 | 0 |
_aMathematics _917741 |
|
| 650 | 0 |
_aComputer science _xMathematics _928157 |
|
| 650 | 0 |
_aGraph theory _928216 |
|
| 690 | 0 |
_a0023 วิศวกรรมศาสตรบัณฑิต สาขาวิศวกรรมคอมพิวเตอร์ CPE (ป.ตรี) _965 |
|
| 690 | 0 |
_a0021 วิทยาศาสตร์บัณฑิต สาขาเทคโนโลยีสารสนเทศ IT (ป.ตรี) _964 |
|
| 690 | 4 |
_a0049 สำนักการศึกษาทั่วไป _9132 |
|
| 700 | 1 |
_aParmenter, Michael M. _930880 |
|
| 942 | _cBK | ||
| 970 |
_l0 _tYes, There are proofs? _pp. 1 |
||
| 970 |
_l1 _tLogic _pp. 19 |
||
| 970 |
_l2. _tSets and relations _pp. 38 |
||
| 970 |
_l3. _tFunctions _pp. 72 |
||
| 970 |
_l4. _tThe Integers _pp. 98 |
||
| 970 |
_l5. _tInduction and recursion _pp. 147 |
||
| 970 |
_l6. _tPrinciples of counting _pp. 184 |
||
| 970 |
_l7. _tPermutations and combinations _pp. 205 |
||
| 970 |
_l8. _tAlgorithms _pp. 247 |
||
| 970 |
_l9. _tGraphs _pp. 281 |
||
| 970 |
_l10 _tPaths and circuits _pp. 304 |
||
| 970 |
_l11. _tApplications of paths and circuits _pp. 339 |
||
| 970 |
_l12. _tTrees _pp. 370 |
||
| 970 |
_l13. _tPlanar graphs and colorings _pp. 411 |
||
| 970 |
_l14. _tThe Max flow-min cut theorem _pp. 438 |
||
| 988 | _c22136 | ||
| 999 |
_c22136 _d22136 |
||