Discrete Mathematics With Graph Theory Classic Version

This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. Please visit www.pearsonhighered.com/math-classics-series for a complete list of titles. Far more "user friendly" than the vast majority of similar books, this text is truly written with the "beginning" reader in mind. The pace is tight, the style is light, and the text emphasizes theorem proving throughout. The authors emphasize "Active Reading," a skill vital to success in learning how to think mathematically (and write clean, error-free programs).

This textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula. The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.

This textbook, now in its fourth edition, continues to provide an accessible introduction to discrete mathematics and graph theory. The introductory material on Mathematical Logic is followed by extensive coverage of combinatorics, recurrence relation, binary relations, coding theory, distributive lattice, bipartite graphs, trees, algebra, and Polya’s counting principle. A number of selected results and methods of discrete mathematics are discussed in a logically coherent fashion from the areas of mathematical logic, set theory, combinatorics, binary relation and function, Boolean lattice, planarity, and group theory. There is an abundance of examples, illustrations and exercises spread throughout the book. A good number of problems in the exercises help students test their knowledge. The text is intended for the undergraduate students of Computer Science and Engineering as well as to the students of Mathematics and those pursuing courses in the areas of Computer Applications and Information Technology. New to the Fourth Edition • Introduces new section on Arithmetic Function in Chapter 9. • Elaborates enumeration of spanning trees of wheel graph, fan graph and ladder graph. • Redistributes most of the problems given in exercises section-wise. • Provides many additional definitions, theorems, examples and exercises. • Gives elaborate hints for solving exercise problems.

Professional electronic edition available from http://diestel-graph-theory.com/professional.html This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. New in this 5th edition: Sections on tangles and tree-width, on tree packing and covering, and on topological spaces as inverse limits of finite graphs. Several new proofs of classical theorems. Many new exercises. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.” Acta Scientiarum Mathematicarum "Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity." Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory.” Bulletin of the Institute of Combinatorics and its Applications “Succeeds dramatically… a hell of a good book.” MAA Reviews “A highlight of the book is what is by far the best account in print of the Seymour-Robertson theory of graph minors.” Mathematika “…like listening to someone explain mathematics.” Bulletin of the AMS

In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition-over 400 pages longer than its prede