| Description |
1 online resource (xvii, 644 pages) : illustrations |
| Series |
Discrete mathematics and its applications |
|
Discrete mathematics and its applications.
|
| Contents |
Introduction to combinatorics -- Sequences -- Solving recurrences -- Evaluating sums -- Binomial coefficients -- Partitions and permutations -- Integer operators -- Graph fundamentals -- Graph theory topics -- Graph enumeration -- Combinatorial designs -- Appendix: Relations and functions ; Algebraic systems ; Finite fields and vector spaces |
| Summary |
Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course. After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation exp |
| Bibliography |
Includes bibliographical references (pages 595-601) and index |
| Notes |
English |
|
Print version record |
| Subject |
Combinatorial analysis -- Data processing
|
|
MATHEMATICS -- General.
|
|
Combinatorial analysis -- Data processing
|
|
Datenverarbeitung
|
|
Kombinatorische Analysis
|
| Form |
Electronic book
|
| ISBN |
9781584887447 |
|
1584887443 |
|
0429142560 |
|
9780429142567 |
|
