A First Course in Discrete Mathematics [electronic resource] / by Ian Anderson.
Material type: Computer filePublication details: London : Springer London : Imprint: Springer, 2002.Edition: 1st ed. 2002Description: VIII, 200 p. online resourceISBN:- 9780857293152
- 511.1Â 23
Item type | Home library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
e-Book | S. R. Ranganathan Learning Hub Online | 511.1 (Browse shelf(Opens below)) | Available | EB1302 |
Browsing S. R. Ranganathan Learning Hub shelves, Shelving location: Online Close shelf browser (Hides shelf browser)
1. Counting and Binomial Coefficients -- 2. Recurrence -- 3. Introduction to Graphs -- 4. Travelling Round a Graph -- 5. Partitions and Colourings -- 6. The Inclusion Exclusion Principle -- 7. Latin Squares and Hall's Theorem -- 8. Schedules and 1-Factorisations -- 9. Introduction to Designs -- Solutions -- Further Reading.
Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergraduate mathematics students, and provides them with many of the basic techniques, ideas and results. It contains many worked examples, and each chapter ends with a large number of exercises, with hints or solutions provided for most of them. As well as including standard topics such as binomial coefficients, recurrence, the inclusion-exclusion principle, trees, Hamiltonian and Eulerian graphs, Latin squares and finite projective planes, the text also includes material on the ménage problem, magic squares, Catalan and Stirling numbers, and tournament schedules.
There are no comments on this title.