This book contains the successful invited submissions to a Special Issue of Symmetry on the subject of “Graph Theory”. Although symmetry has always played an important role in Graph Theory, in recent years, this role has increased significantly in several branches of this field, including but not limited to Gromov hyperbolic graphs, the metric dimension of graphs, domination theory, and topological indices. This Special Issue includes contributions addressing new results on these topics, both from a theoretical and an applied point of view.

The first full-length book on the theme of symmetry in graphs, a fast-growing topic in algebraic graph theory.

This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included at the end of each chapter, thereby covering most of the major advances in the last twenty years. Professor Biggs' basic aim remains to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first part, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject which has strong links with the 'interaction models' studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. This new and enlarged edition this will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.

This book consists of a selection of peer-reviewed contributions to the Workshop on Algebraic Graph Theory that took place in Pilsen, Czech Republic in October 2016. Primarily intended for early career researchers, it presents eight self-contained articles on a selection of topics within algebraic combinatorics, ranging from association schemes to symmetries of graphs and isomorphism testing. Algebraic combinatorics is a compelling mathematical discipline based on the powerful interplay of algebraic and combinatorial methods. Algebraic interpretation of combinatorial structures (such as symmetry or regularity) has often led to enlightening discoveries and powerful results, while discrete and combinatorial structures have given rise to new algebraic structures that have found valuable applications. In addition to these original research contributions, the reader will find a survey linking numerous threads in algebraic combinatorics, and an extensive tutorial showcasing the universality of algebraic methods in the study of combinatorial structures.

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c

This volume presents the fundamentals of graph theory and then goes on to discuss specific chemical applications. Chapter 1 provides a historical setting for the current upsurge of interest in chemical graph theory. Chapter 2 gives a full background of the basic ideas and mathematical formalism of graph theory and includes such chemically relevant notions as connectedness, graph matrix representations, metric properties, symmetry and operations on graphs. This is followed by a discussion on chemical nomenclature and the trends in its rationalization by using graph theory, which has important implications for the storage and retrieval of chemical information. This volume also contains a detailed discussion of the relevance of graph-theoretical polynomials; it describes methodologies for the enumeration of isomers, incorporating the classical Polya method, as well as more recent approaches.

Near Rings, Fuzzy Ideals, and Graph Theory explores the relationship between near rings and fuzzy sets and between near rings and graph theory. It covers topics from recent literature along with several characterizations.After introducing all of the necessary fundamentals of algebraic systems, the book presents the essentials of near rings theory,

There is no other book with such a wide scope of both areas of algebraic graph theory.

Continuing to provide a carefully written, thorough introduction, Graphs & Digraphs, Fifth Edition expertly describes the concepts, theorems, history, and applications of graph theory. Nearly 50 percent longer than its bestselling predecessor, this edition reorganizes the material and presents many new topics. New to the Fifth Edition New or expanded coverage of graph minors, perfect graphs, chromatic polynomials, nowhere-zero flows, flows in networks, degree sequences, toughness, list colorings, and list edge colorings New examples, figures, and applications to illustrate concepts and theorems Expanded historical discussions of well-known mathematicians and problems More than 300 new exercises, along with hints and solutions to odd-numbered exercises at the back of the book Reorganization of sections into subsections to make the material easier to read Bolded definitions of terms, making them easier to locate Despite a field that has evolved over the years, this student-friendly, classroom-tested text remains the consummate introduction to graph theory. It explores the subject’s fascinating history and presents a host of interesting problems and diverse applications.

The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approach