Mardigian Library
Ask a QuestionMy Library Account
Search Library Catalog - Books, DVDs & More
Limit to available
More Searches
   
Limit results to available items
Find more results:
Search MelCat
More Information
  
Biggs, Norman
Discrete mathematics / Norman L. Biggs
2nd ed
Oxford [England] ; New York : Oxford University Press, 2002
book jacket
Location Call Number Status
 4th Floor  QA76.9.M35 B54 2002    AVAILABLE
Subject(s) Computer science -- Mathematics
Graph theory
Combinatorial analysis
Number theory
Coding theory
Physical Description xiv, 425 p. : ill. ; 26 cm
Note Includes index
Contents Pt. I. Foundations. 1. Statements and proofs. 2. Set notation. 3. The logical framework. 4. Natural numbers. 5. Functions. 6. How to count. 7. Integers. 8. Divisibility and prime numbers. 9. Fractions and real numbers -- Pt. II. Techniques. 10. Principles of counting. 11. Subsets and designs. 12. Partition, classification, and distribution. 13. Modular arithmetic -- Pt. III. Algorithms and Graphs. 14. Algorithms and their efficiency. 15. Graphs. 16. Trees, sorting, and searching. 17. Bipartite graphs and matching problems. 18. Digraphs, networks, and flows. 19. Recursive techniques -- Pt. IV. Algebraic Methods. 20. Groups. 21. Groups of permutations. 22. Rings, fields, and polynomials. 23. Finite fields and some applications. 24. Error-correcting codes. 25. Generating functions. 26. Partitions of a positive integer. 27. Symmetry and counting
NOTE 507983

Mardigian Library, 4901 Evergreen Rd.
Dearborn, MI 48128-1491 313-593-5400 fax 313-593-5561
ask-a-question@umd.umich.edu
The Regents of the University of Michigan | Non-Discrimination Policy
Copyright © The University of Michigan - Dearborn • 4901 Evergreen Road • Dearborn, Michigan 48128 • 313-593-5000
The University of Michigan - Ann Arbor | The University of Michigan - Flint | SITEMAP | DIRECTORY | CONTACT