Configurations can be studied from a graph-theoretical viewpoint via the so-called Levi graphs and lie at the heart of graphs, groups, surfaces, and geometries, all of which are very active areas of mathematical exploration. In this self-contained textbook, algebraic graph theory is used to introduce groups; topological graph theory is used to explore surfaces; and geometric graph theory is implemented to analyze incidence geometries. After a preview of configurations in Chapter 1, a concise introduction to graph theory is presented in Chapter 2, followed by a geometric introduction to groups in Chapter 3. Maps and surfaces are combinatorially treated in Chapter 4. Chapter 5 introduces the concept of incidence structure through vertex colored graphs, and the combinatorial aspects of classical configurations are studied. Geometric aspects, some historical remarks, references, and applications of classical configurations appear in the last chapter. With over two hundred illustrations, challenging exercises at the end of each chapter, a comprehensive bibliography, and a set of open problems, Configurations from a Graphical Viewpoint is well suited for a graduate graph theory course, an advanced undergraduate seminar, or a self-contained reference for mathematicians and researchers.

Discrete Mathematics provides key concepts and a solid, rigorous foundation in mathematical reasoning. Appropriate for undergraduate as well as a starting point for more advanced class, the resource offers a logical progression through key topics without assuming any background in algebra or computational skills and without duplicating what they will learn in higher level courses. The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction. For students interested to dive into this subject, the text offers a rigorous introduction to mathematical thought through useful examples and exercises.

This book presents rigidity theory in a historical context. The combinatorial aspects of rigidity are isolated and framed in terms of a special class of matroids, which are a natural generalization of the connectivity matroid of a graph. The book includes an introduction to matroid theory and an extensive study of planar rigidity. The final chapter is devoted to higher dimensional rigidity, highlighting the main open questions. Also included is an extensive annotated bibiolography with over 150 entries. The book is aimed at graduate students and researchers in graph theory and combinatorics or in fields which apply the structural aspects of these subjects in architecture and engineering. Accessible to those who have had an introduction to graph theory at the senior or graduate level, the book would be suitable for a graduate course in graph theory.