Introductory combinatorics Richard A Brualdi
Material type: TextLanguage: English Series: Always LearningPublication details: Noida : Pearson Education, 2004.Edition: 4th edDescription: x, 630 pages : ill.; 24 cmISBN:- 9788131718827
- 511.6 BRU
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 BRU (Browse shelf(Opens below)) | Available | 36667 | |
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 BRU (Browse shelf(Opens below)) | Available | 36668 |
Browsing CUTN Central Library shelves, Shelving location: Sciences, Collection: Non-fiction Close shelf browser (Hides shelf browser)
511.56 CHA Chromatic graph theory / | 511.56 CHA Chromatic Graph Theory / | 511.6 BAB Discrete mathematics | 511.6 BRU Introductory combinatorics | 511.6 BRU Introductory combinatorics | 511.6 CHO Fundamentals of Discrete mathematical structures | 511.6 CHO Fundamentals of Discrete mathematical structures |
What Is Combinatorics?
The Pigeonhole Principle.
Permutations and Combinations.
Generating Permutations and Combinations.
The Binomial Coefficients.
The Inclusion-Exclusion Principle and Applications.
Recurrence Relations and Generating Functions.
Special Counting Sequences.
Matchings in Bipartite Graphs.
Combinatorial Designs.
Introduction to Graph Theory.
Digraphs and Networks.
More on Graph Theory.
Polya Counting.
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.
There are no comments on this title.