A First Course in Discrete Mathematics

by Ian C. Anderson

Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.

Genres: Mathematics, Science

Paperback

First published October 27, 2000

Reviews

[Milad · Rating 4 out of 5]

Not a big book with many different topics, but the definitions and theorems that are there are actually adequate and thorough.

[Avina · Rating 1 out of 5]

Do not recommend it to learn discrete math (despite it's title). Terms are not in-sync with current terms, for example, chapter 1 could just as easily be called "Permutations and Combinations". Not for beginner.

At most useful for the intermediate-level folks looking for extra practice.

[Saman · Rating 1 out of 5]

there are a lot of nice ways to learn Discrete Math, It's not one of them.