Explores modern topics in graph theory and its applications to problems in transportation, genetics, pollution, perturbed ecosystems, urban services, and social inequalities. The author presents both traditional and relatively atypical graph-theoretical topics to best illustrate applications.

This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organizers, Joel Cohen and Fred Roberts, for organizing a workshop which brought together many of the major figures in a variety of research fields connected with the application of combinatorial ideas to the social and biological sciences. A vner Friedman Willard Miller APPLICATIONS OF COMBINATORICS AND GRAPH THEORY TO THE BIOLOGICAL AND SOCIAL SCIENCES: SEVEN FUNDAMENTAL IDEAS FRED S. RoBERTS* Abstract. To set the stage for the other papers in this volume, seven fundamental concepts which arise in the applications of combinatorics and graph theory in the biological and social sciences are described. These ideas are: RNA chains as "words" in a 4 letter alphabet; interval graphs; competition graphs or niche overlap graphs; qualitative stability; balanced signed graphs; social welfare functions; and semiorders. For each idea, some basic results are presented, some recent results are given, and some open problems are mentioned.

This second edition includes two new chapters: one on domination in graphs and the other on the spectral properties of graphs, the latter including a discussion on graph energy. The chapter on graph colorings has been enlarged, covering additional topics such as homomorphisms and colorings and the uniqueness of the Mycielskian up to isomorphism. This book also introduces several interesting topics such as Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on the hamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, Fournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46 vertices, and a concrete application of triangulated graphs.

Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well. The textbook takes a comprehensive, accessible approach to graph theory, integrating careful exposition of classical developments with emerging methods, models, and practical needs. The authors’ unparalleled treatment is an ideal text for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology. Features of the Third Edition Expanded coverage on several topics (e.g., applications of graph coloring and tree-decompositions) Provides better coverage of algorithms and algebraic and topological graph theory than any other text Incorporates several levels of carefully designed exercises that promote student retention and develop and sharpen problem-solving skills Includes supplementary exercises to develop problem-solving skills, solutions and hints, and a detailed appendix, which reviews the textbook’s topics About the Authors Jonathan L. Gross is a professor of computer science at Columbia University. His research interests include topology and graph theory. Jay Yellen is a professor of mathematics at Rollins College. His current areas of research include graph theory, combinatorics, and algorithms. Mark Anderson is also a mathematics professor at Rollins College. His research interest in graph theory centers on the topological or algebraic side.

The first part of this text covers the main graph theoretic topics: connectivity, trees, traversability, planarity, colouring, covering, matching, digraphs, networks, matrices of a graph, graph theoretic algorithms, and matroids. These concepts are then applied in the second part to problems in engineering, operations research, and science as well as to an interesting set of miscellaneous problems, thus illustrating their broad applicability. Every effort has been made to present applications that use not merely the notation and terminology of graph theory, but also its actual mathematical results. Some of the applications, such as in molecular evolution, facilities layout, and graffic network design, have never appeared before in book form. Written at an advanced undergraduate to beginning graduate level, this book is suitable for students of mathematics, engineering, operations research, computer science, and physical sciences as well as for researchers and practitioners with an interest in graph theoretic modelling.

Graph Theory (as a recognized discipline) is a relative newcomer to Mathematics. The first formal paper is found in the work of Leonhard Euler in 1736. In recent years the subject has grown so rapidly that in today's literature, graph theory papers abound with new mathematical developments and significant applications.As with any academic field, it is good to step back occasionally and ask Where is all this activity taking us?, What are the outstanding fundamental problems?, What are the next important steps to take?. In short, Quo Vadis, Graph Theory?. The contributors to this volume have together provided a comprehensive reference source for future directions and open questions in the field.

In the rapidly developing field of bioconsensus, consensus methods from the social and behavioral sciences are used when choosing among alternative solutions to problems in the biological sciences. This text for mathematical and evolutionary biologists and computer scientists contains 16 contributions on various topics in bioconsensus. Included are papers originally presented at meetings held in 2000 and 2001 at the DIMACS Center as well as some from experts who did not attend the meetings. These papers provide historical background, discuss the axiomatic foundations of the field of bioconsensus, and apply consensus methods to real data. The volume is not indexed. Annotation (c)2003 Book News, Inc., Portland, OR (booknews.com).

The intuitive diagrammatic nature of graphs makes them useful in modelling systems in engineering problems. This text gives an account of material related to such applications, including minimal cost flows and rectangular dissection and layouts. A major th