000			02084aam a2200373 a 4500
001			015864607
003			OSt
005			20190927144829.0
008			111031s2012 nju b 001 0 eng
010			_a2011044318
015			_aGBB194121 _2bnb
016	7		_a015864607 _2Uk
020			_a9788126566198 (Pbk)
040			_aStDuBDS _beng _cIISER Bhopal _dUk
042			_aukblsr
050	0	0	_aQA164 _b.T83 2012
082	0	0	_a511.6 T79A6 _223
100	1		_aTucker, Alan. _925379
222			_aNBHM-collection
222			_aMathematics-reference book collection
245	1	0	_aApplied combinatorics _cAlan Tucker.
250			_a6th ed.
260			_aNew Delhi : _bWiley India Pvt. Ltd.,, _c2017.
300			_axv, 480 p. ; _c25 cm.
500			_aFormerly CIP. _5Uk
504			_aIncludes bibliographical references and index.
505	8		_aMachine generated contents note: Prelude. Part One: Graph Theory. Chapter 1: Elements of Graph Theory. Chapter 2: Covering Circuits and Graph coloring. Chapter 3: Trees and Searching. Chapter 4: Network Algorithms. Part Two: Enumeration. Chapter 5: General Counting Methods for Arrangements and Selections. Chapter 6: Generating Functions. Chapter 7: Recurrence Relations. Chapter 8: Inclusion-Exclusion. Part Three: Additional Topics. Chapter 9: Polya's Enumeration Formula. Chapter 10: Games with Grapes. Postlude. Appendix.
520			_a"Alan Tucker's newest issue of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving. As one of the most widely used book in combinatorial problems, this edition explains how to reason and model combinatorically while stressing the systematic analysis of different possibilities, exploration of the logical structure of a problem, and ingenuity"--
650		0	_aCombinatorial analysis. _925380
650		0	_aGraph theory. _925381
650		7	_aMATHEMATICS / Combinatorics. _2bisacsh _925382
942			_2ddc _cBK
999			_c9005 _d9005