Book Series: Annals of Discrete MathematicsWe are always looking for ways to improve customer experience on Elsevier. We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit. If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website. Thanks in advance for your time. Skip to content. Search for books, journals or webpages
Rosen Discrete mathematics Book Review - Discrete Mathematics and Its Applications
Helping Teachers to Teach and Students to Learn
Skip to main content. There's a problem loading this menu right now. Learn more about Amazon Prime. Get fast, free delivery with Amazon Prime. Amazon Best Sellers Our most popular products based on sales.
Read online. Download PDF. Buy paperback. Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course for math majors, especially those who will go on to teach. Since Spring , the book has been used as the primary textbook or a supplemental resource at multiple universities around the world see the partial adoptions list.
Discrete Mathematics 1: Introduction to Graphs
This textbook, now in its third edition, continues to provide an accessible introduction to discrete mathematics and graph theory. 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 students of Mathematics and those pursuing courses in the areas of Computer Applications and Information Technology. Contains new sections on Enumeration of graphs, Branching process in enumerating trees, Pseudo Boolean lattice, and Subgroup. Redistributes most of the problems given in exercises section-wise.