01768cam a22002894a 450000100090000000300060000900500170001500800410003201000170007302000180009004000180010804200080012605000210013408200210015508400230017610000170019924500390021625000120025526000320026730000330029950400510033250505310038352004760091465000280139065000180141865000420143617028849IIITD20191112020002.0111031s2012 nju b 001 0 eng a 2011044318 a9788126566198 aDLCcDLCdDLC apcc00aQA164b.T83 201200a511.6223bTUC-A aMAT0360002bisacsh1 aTucker, Alan10aApplied combinatoricscAlan Tucker a6th ed. aNew Delhi :bWiley,cİ1995 axv, 480 p. ;cill. :b25 cm. aIncludes bibliographical references and index.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. 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"-- 0aCombinatorial analysis. 0aGraph theory. 7aMATHEMATICS / Combinatorics.2bisacsh