http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Combinatorial methods with computer applications
1 online resource (xvii, 644 pages) : illustrations
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.
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.
Includes bibliographical references (pages 595-601) and index.
Boca Raton, FL : Chapman & Hall/CRC, ©2008
Discrete mathematics and its applications