Combinatorial methods with computer applications /

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 mathe...

Full description

Bibliographic Details
Main Author: Gross, Jonathan L.
Corporate Author: Taylor & Francis
Format: eBook
Language:English
Language Notes:English.
Published: Boca Raton, FL : Chapman & Hall/CRC, ©2008.
Series:Discrete mathematics and its applications.
Subjects:
Online Access:Connect to the full text of this electronic book
Description
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.
Physical Description:1 online resource (xvii, 644 pages) : illustrations
Bibliography:Includes bibliographical references (pages 595-601) and index.
ISBN:9781584887447
1584887443
0429142560
9780429142567