Artículos relacionados a A First Course in Discrete Mathematics (Springer Undergradua...

A First Course in Discrete Mathematics (Springer Undergraduate Mathematics Series) - Tapa blanda

Libro 31 de 90: Springer Undergraduate Mathematics

Lian, Brian

 
9781852332365: A First Course in Discrete Mathematics (Springer Undergraduate Mathematics Series)
Tapa blanda
ISBN 10: 1852332360 ISBN 13: 9781852332365
Editorial: Springer, 2000

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Críticas

"Wie der Titel andeutet, handelt es sich bei diesem Buch um eine elementare Einführung in Denkweisen und Methoden der Diskreten Mathematik. Die fachlichen Voraussetzungen an den Leser sind minimal. Darauf aufbauend wird ein doch recht buntes Bild entwickelt, bestehend vor allem aus den wichtigsten Konzepten aus Kombinatorik und Graphentheorie sowie einigen spezielleren Themen wie Designs und Codes.
... Der Vorteil besteht darin, dass auch dem mathematischen Laien auf knapp 200 Seiten ein durchaus einprägsames Bild von einem Zweig der Mathematik vermittelt wird, der in unserer Zeit u.a. durch die Allgegenwart der sogenannten Informationstechnologie extrem an Bedeutung gewonnen hat."
Internationale Mathematische Nachrichten, Nr. 187, August 2001

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2000
Idioma
Inglés
ISBN 10 
1852332360
ISBN 13 
9781852332365
Encuadernación
Tapa blanda
Número de páginas
212
Contacto del fabricante
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Alemania