Higher Ed. and Vocational >> Engineering and Computer Science >> Computer Science >> Discrete Mathematics


Introductory Combinatorics, 4/e

Introductory Combinatorics,  4/e

Author(s):
  • Richard A. Brualdi
  • Author: Richard A. Brualdi
    • ISBN:9788131718827
    • 10 Digit ISBN:8131718824
    • Price:Rs. 875.00
    • Pages:640
    • Imprint:Pearson Education
    • Binding:Paperback
    • Status:Available


    Ratings:

    This, the best selling book in its market, emphasizes combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, PĆ³lya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs), flows in networks.

    Table of Content

    1. What Is Combinatorics?
    2. The Pigeonhole Principle.
    3. Permutations and Combinations.
    4. Generating Permutations and Combinations.
    5. The Binomial Coefficients.
    6. The Inclusion-Exclusion Principle and Applications.
    7. Recurrence Relations and Generating Functions.
    8. Special Counting Sequences.
    9. Matchings in Bipartite Graphs.
    10. Combinatorial Designs.
    11. Introduction to Graph Theory.
    12. Digraphs and Networks.
    13. More on Graph Theory.
    14. Polya Counting.

    Salient Features

    • NEW - New problems in each chapter-Many more challenging problem sets have been added.
    • Presents an excellent treatment of Polya's Counting Theoremthat doesn't assume students have seen group theory.
    • Many worked examples.