The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.

The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references.

MATRIX is Australia’s international and residential mathematical research institute. It facilitates new collaborations and mathematical advances through intensive residential research programs, each 1-4 weeks in duration. This book is a scientific record of the ten programs held at MATRIX in 2019 and the two programs held in January 2020: · Topology of Manifolds: Interactions Between High and Low Dimensions · Australian-German Workshop on Differential Geometry in the Large · Aperiodic Order meets Number Theory · Ergodic Theory, Diophantine Approximation and Related Topics · Influencing Public Health Policy with Data-informed Mathematical Models of Infectious Diseases · International Workshop on Spatial Statistics · Mathematics of Physiological Rhythms · Conservation Laws, Interfaces and Mixing · Structural Graph Theory Downunder · Tropical Geometry and Mirror Symmetry · Early Career Researchers Workshop on Geometric Analysis and PDEs · Harmonic Analysis and Dispersive PDEs: Problems and Progress The articles are grouped into peer-reviewed contributions and other contributions. The peer-reviewed articles present original results or reviews on a topic related to the MATRIX program; the remaining contributions are predominantly lecture notes or short articles based on talks or activities at MATRIX.

This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held at the University of Washington in Seattle in the summer of 1991. Among the topics covered are: algorithms on tree-structured graphs, well-quasi-ordering, logic, infinite graphs, disjoint path problems, surface embeddings, knot theory, graph polynomials, matroid theory, and combinatorial optimization.

This book clearly describes the many applications of graph theory to ecological questions, providing instruction and encouragement to researchers.

Graph-structured data is ubiquitous throughout the natural and social sciences, from telecommunication networks to quantum chemistry. Building relational inductive biases into deep learning architectures is crucial for creating systems that can learn, reason, and generalize from this kind of data. Recent years have seen a surge in research on graph representation learning, including techniques for deep graph embeddings, generalizations of convolutional neural networks to graph-structured data, and neural message-passing approaches inspired by belief propagation. These advances in graph representation learning have led to new state-of-the-art results in numerous domains, including chemical synthesis, 3D vision, recommender systems, question answering, and social network analysis. This book provides a synthesis and overview of graph representation learning. It begins with a discussion of the goals of graph representation learning as well as key methodological foundations in graph theory and network analysis. Following this, the book introduces and reviews methods for learning node embeddings, including random-walk-based methods and applications to knowledge graphs. It then provides a technical synthesis and introduction to the highly successful graph neural network (GNN) formalism, which has become a dominant and fast-growing paradigm for deep learning with graph data. The book concludes with a synthesis of recent advancements in deep generative models for graphs—a nascent but quickly growing subset of graph representation learning.

New Edition! Completely Revised and Updated Chemical Graph Theory, 2nd Edition is a completely revised and updated edition of a highly regarded book that has been widely used since its publication in 1983. This unique book offers a basic introduction to the handling of molecular graphs - mathematical diagrams representing molecular structures. Using mathematics well within the vocabulary of most chemists, this volume elucidates the structural aspects of chemical graph theory: (1) the relationship between chemical and graph-theoretical terminology, elements of graph theory, and graph-theoretical matrices; (2) the topological aspects of the Hückel theory, resonance theory, and theories of aromaticity; and (3) the applications of chemical graph theory to structure-property and structure-activity relationships and to isomer enumeration. An extensive bibliography covering the most relevant advances in theory and applications is one of the book's most valuable features. This volume is intended to introduce the entire chemistry community to the applications of graph theory and will be of particular interest to theoretical organic and inorganic chemists, physical scientists, computational chemists, and those already involved in mathematical chemistry.

Written by two prominent figures in the field, this comprehensive text provides a remarkably student-friendly approach. Its sound yet accessible treatment emphasizes the history of graph theory and offers unique examples and lucid proofs. 2004 edition.