By: Tucker, Alan.Material type: BookPublisher: New Delhi : Wiley, ©1995Edition: 6th ed.Description: xv, 480 p. ; ill. : 25 cm.ISBN: 9788126566198.Subject(s): Combinatorial analysis | Graph theory | MATHEMATICS / Combinatorics
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds||Course reserves|
|Books||IIITD Reference||Mathematics||REF 511.6 TUC-A (Browse shelf)||Not For Loan||008180|
|Books||IIITD General Stacks||Mathematics||511.6 TUC-A (Browse shelf)||Available||007551|
Browsing IIITD Shelves , Shelving location: General Stacks , Collection code: Mathematics Close shelf browser
|511.6 STI-C Combinatorial designs :||511.6 STI-C Combinatorial designs :||511.6 TAO-A Additive combinatorics||511.6 TUC-A Applied combinatorics||511.62 AIG-C A course in enumeration||511.66 AND-G Geometric problems on maxima and minima||511.66 TIK-S Stories about maxima and minima|
Includes bibliographical references and index.
Machine 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.
"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"--