Graph Theory and Computing focuses on the processes, methodologies, problems, and approaches involved in graph theory and computer science. The book first elaborates on alternating chain methods, average height of planted plane trees, and numbering of a graph. Discussions focus on numbered graphs and difference sets, Euclidean models and complete graphs, classes and conditions for graceful graphs, and maximum matching problem. The manuscript then elaborates on the evolution of the path number of a graph, production of graphs by computer, and graph-theoretic programming language. Topics include FORTRAN characteristics of GTPL, design considerations, representation and identification of graphs in a computer, production of simple graphs and star topologies, and production of stars having a given topology. The manuscript examines the entropy of transformed finite-state automata and associated languages; counting hexagonal and triangular polyominoes; and symmetry of cubical and general polyominoes. Graph coloring algorithms, algebraic isomorphism invariants for graphs of automata, and coding of various kinds of unlabeled trees are also discussed. The publication is a valuable source of information for researchers interested in graph theory and computing.

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science. Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter

Outstanding introductory treatment, geared toward advanced undergraduates and graduate students who require knowledge of graph theory. The first nine chapters constitute an excellent overview; the remaining chapters are more advanced and provide material for a variety of courses. 1974 edition.

This book describes a set of hybrid fuzzy models showing how to use them to deal with incomplete and/or vague information in different kind of decision-making problems. Based on the authors’ research, it offers a concise introduction to important models, ranging from rough fuzzy digraphs and intuitionistic fuzzy rough models to bipolar fuzzy soft graphs and neutrosophic graphs, explaining how to construct them. For each method, applications to different multi-attribute, multi-criteria decision-making problems, are presented and discussed. The book, which addresses computer scientists, mathematicians, and social scientists, is intended as concise yet complete guide to basic tools for constructing hybrid intelligent models for dealing with some interesting real-world problems. It is also expected to stimulate readers’ creativity thus offering a source of inspiration for future research.

This book presents novel graph-theoretic methods for complex computer vision and pattern recognition tasks. It presents the application of graph theory to low-level processing of digital images, presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, and provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks.

Graph Theory in Modern Engineering: Computer Aided Design, Control, Optimization, Reliability Analysis

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.

"Graph Theory: Adiabatic Quantum Computing Methods" explores the convergence of quantum computing and graph theory, offering a comprehensive examination of how quantum algorithms can tackle fundamental graph problems. From foundational concepts to advanced applications in fields like cryptography, machine learning, and network analysis, this book provides a clear pathway into the evolving landscape of quantum-enhanced graph algorithms. Designed for researchers, students, and professionals alike, it bridges theoretical insights with practical implementations, paving the way for innovative solutions in computational graph theory.

"Combinatorial Problems in Graph Theory" offers a comprehensive introduction to the fundamentals of graph theory for beginners. Exploring the fascinating world of graphs, this book covers essential concepts, from basic definitions to advanced applications across diverse fields such as computer science, optimization, and social networks. With clear explanations, practical examples, and engaging problems, it equips readers with the foundational knowledge needed to understand and solve combinatorial problems using graph theory. Ideal for students and enthusiasts alike, this book serves as an accessible entry point into this essential branch of mathematics.