Combinatorial Methods with Computer Applications
Format: Hardcover
ISBN13: 9781584887430
Hardcover|9781584887430
✨ Featured Offer
Brand New
$182.02
List Price: $160.00
🚚
See all 5 offers from $113.04 FREE standard delivery by: 02 Apr 2026
Overview
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 expressions, binomial coefficients, partitions and permutations, and integer methods. The author then focuses on graph theory, covering topics such as trees, isomorphism, automorphism, planarity, coloring, and network flows. The final chapters discuss automorphism groups in algebraic counting methods and describe combinatorial designs, including Latin squares, block designs, projective planes, and affine planes. In addition, the appendix supplies background material on relations, functions, algebraic systems, finite fields, and vector spaces.
Paving the way for students to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences.
After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation expressions, binomial coefficients, partitions and permutations, and integer methods. The author then focuses on graph theory, covering topics such as trees, isomorphism, automorphism, planarity, coloring, and network flows. The final chapters discuss automorphism groups in algebraic counting methods and describe combinatorial designs, including Latin squares, block designs, projective planes, and affine planes. In addition, the appendix supplies background material on relations, functions, algebraic systems, finite fields, and vector spaces.
Paving the way for students to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences.
| ISBN-13 | 9781584887430 |
|---|---|
| ISBN-10 | 1584887435 |
| Weight | 2.90 Pounds |
| Dimensions | 7.26 x 1.53 x 10.31 In |
| List Price | $160.00 |
| Edition | 1st Edition |
| Format | Hardcover |
|---|---|
| Language | English |
| Pages | 664 pages |
| Publisher | Chapman and Hall/CRC |
| Published On | 2007-11-16 |
View All Offers
Sort by:
Price
Condition
Seller
Seller Comments
Price
Used, Good
Seller details
3brothers Bookstore
Absecon, NJ, USA
Cover may have light wear pages in very good condition and binding is sturdy; may have other light s...
Free delivery by: 02 Apr 2026
Used, Very Good
Seller details
Solr Books
Lincolnwood, IL, USA
This books is in Very good condition. There may be a few flaws like shelf wear and some light wear.
Free delivery by: 02 Apr 2026
Used, Like New
Seller details
GreatBookPrices-
Columbia, MD, USA
100% Money Back Guarantee. Brand New, Perfect Condition. We offer expedited shipping to all US locat...
Free delivery by: 02 Apr 2026
Used, Good
Seller details
Bonita
Santa Clarita, CA, USA
Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Free delivery by: 02 Apr 2026
✨ Brand New
Seller details
GreatBookPrices-
Columbia, MD, USA
100% Money Back Guarantee. Brand New, Perfect Condition. We offer expedited shipping to all US locat...
Free delivery by: 02 Apr 2026