A First Course in Discrete Mathematics

Nonfiction, Science & Nature, Mathematics, Combinatorics, Discrete Mathematics
Cover of the book A First Course in Discrete Mathematics by Ian Anderson, Springer London
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Ian Anderson ISBN: 9780857293152
Publisher: Springer London Publication: December 6, 2012
Imprint: Springer Language: English
Author: Ian Anderson
ISBN: 9780857293152
Publisher: Springer London
Publication: December 6, 2012
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer London

Cover of the book Graph-Based Clustering and Data Visualization Algorithms by Ian Anderson
Cover of the book Model Predictive Vibration Control by Ian Anderson
Cover of the book Imaging Spectroscopy for Scene Analysis by Ian Anderson
Cover of the book Elementary Logic by Ian Anderson
Cover of the book Monotone Complete C*-algebras and Generic Dynamics by Ian Anderson
Cover of the book Cancer: Palliative Care by Ian Anderson
Cover of the book Fuzzy Hierarchical Model for Risk Assessment by Ian Anderson
Cover of the book MRI from A to Z by Ian Anderson
Cover of the book Robust and Optimal Control by Ian Anderson
Cover of the book Clinical Aspects of Blood Viscosity and Cell Deformability by Ian Anderson
Cover of the book Computational Social Networks by Ian Anderson
Cover of the book Grasping in Robotics by Ian Anderson
Cover of the book Adult ADHD by Ian Anderson
Cover of the book Bone-Metabolic Functions and Modulators by Ian Anderson
Cover of the book Digital Communication in Medical Practice by Ian Anderson
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy