This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick's theorem on areas of lattice polygons and Graham-Pollak's work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level.

Most introduction to proofs textbooks focus on the structure of rigorous mathematical language and only use mathematical topics incidentally as illustrations and exercises. In contrast, this book gives students practice in proof writing while simultaneously providing a rigorous introduction to number systems and their properties. Understanding the properties of these systems is necessary throughout higher mathematics. The book is an ideal introduction to mathematical reasoning and proof techniques, building on familiar content to ensure comprehension of more advanced topics in abstract algebra and real analysis with over 700 exercises as well as many examples throughout. Readers will learn and practice writing proofs related to new abstract concepts while learning new mathematical content. The first task is analogous to practicing soccer while the second is akin to playing soccer in a real match. The authors believe that all students should practice and play mathematics. The book is written for students who already have some familiarity with formal proof writing but would like to have some extra preparation before taking higher mathematics courses like abstract algebra and real analysis.

This book discusses the origin of graph theory from its humble beginnings in recreational mathematics to its modern setting or modeling communication networks, as is evidenced by the World Wide Web graph used by many Internet search engines. The second edition of the book includes recent developments in the theory of signed adjacency matrices involving the proof of sensitivity conjecture and the theory of Ramanujan graphs. In addition, the book discusses topics such as Pick’s theorem on areas of lattice polygons and Graham–Pollak’s work on addressing of graphs. The concept of graph is fundamental in mathematics and engineering, as it conveniently encodes diverse relations and facilitates combinatorial analysis of many theoretical and practical problems. The text is ideal for a one-semester course at the advanced undergraduate level or beginning graduate level.