Fler böcker inom

Diskret matematik

Format: Häftad (Paperback)
Språk: Engelska
Antal sidor: 218
Utgivningsdatum: 2015-08-13
Upplaga: 2
Förlag: The Mathematical Association of America
Illustratör/Fotograf: 640 exercises
Illustrationer: 640 exercises
Dimensioner: 253 x 179 x 13 mm
Vikt
Antal komponenter: 1
ISBN: 9780883857724

Combining the features of a textbook with those of a problem workbook, this text for mathematics, computer science and engineering students presents a natural, friendly way to learn some of the essential ideas of graph theory. The material is explained using 360 strategically placed problems with connecting text, which is then supplemented by 280 additional homework problems. This problem-oriented format encourages active involvement by the reader while always giving clear direction. This approach is especially valuable with the presentation of proofs, which become more frequent and elaborate as the book progresses. Arguments are arranged in digestible chunks and always appear together with concrete examples to help remind the reader of the bigger picture. Topics include spanning tree algorithms, Euler paths, Hamilton paths and cycles, independence and covering, connections and obstructions, and vertex and edge colourings.

Visa hela texten

Number Fields

Daniel A Marcus

Requiring no more than a basic knowledge of abstract algebra, this textbook presents the basics of algebraic number theory in a straightforward, "down-to-earth" manner. It thus avoids local methods, for example, and presents proofs in a ...

504

Köp

Skickas inom vardagar.
Combinatorics: A Problem Oriented Approach

Daniel A Marcus

The format of this book is unique in that it combines features of a traditional text with those of a problem book. The material is presented through a series of problems, about 250 in all, with connecting text; this is supplemented by a further 25...

585

Köp

Skickas inom vardagar.

This work could be the basis for a very nice one-semester ""transition"" course in which students evolve from users of theorems to creators of proofs. With their intuitive appeal and pictorial representations, graphs may be a better basis than analysis and limits for such a transtion."" - Choice

Daniel A. Marcus received his PhD from Harvard University. He was a J. Willard Gibbs Instructor at Yale University from 1972 to 1974 and Professor of Mathematics at California State Polytechnic University, Pomona, from 1979 to 2004.

Preface; 1. Introduction: problems of graph theory; 2. Basic concepts; 3. Isomorphic graphs; 4. Bipartite graphs; 5. Trees and forests; 6. Spanning tree algorithms; 7. Euler paths; 8. Hamilton paths and cycles; 9. Planar graphs; 10. Independence and covering; 11. Connections and obstructions; 12. Vertex coloring; 13. Edge coloring; 14. Matching theory for bipartite graphs; 15. Applications of matching theory; 16. Cycle-free digraphs; 17. Network flow theory; 18. Flow problems with lower bounds; Answers to selected problems; Index; About the author.