Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of “magic” ideas have been applied to graphs. Recently there has been a resurgence of interest in “magic labelings” due to a number of results that have applications to the problem of decomposing graphs into trees. Key features of this second edition include: · a new chapter on magic labeling of directed graphs · applications of theorems from graph theory and interesting counting arguments · new research problems and exercises covering a range of difficulties · a fully updated bibliography and index This concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings. It may serve as a graduate or advanced undergraduate text for courses in mathematics or computer science, and as reference for the researcher.

Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs. Long-standing problems are surveyed and presented along with recent results in classical labelings. In addition, the book covers an assortment of variations on the labeling theme, all in one self-contained monograph. Assuming only basic familiarity with graphs, this book, complete with carefully written proofs of most results, is an ideal introduction to graph labeling for students learning the subject. More than 150 open problems and conjectures make it an invaluable guide for postgraduate and early career researchers, as well as an excellent reference for established graph theorists.

Graph theory, and graph labeling in particular, are fast-growing research areas in mathematics. New results are constantly being discovered and published at a rapidly increasing rate due to the enormous number of open problems and conjectures in the field. This book deals mainly with the super edge-antimagic branch of graph labeling. It is written for specialists, but could be read also by postgraduate or undergraduate students with high school knowledge of mathematics and a vibrant interest in problem-solving.

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

This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008. The 44 revised full papers were carefully reviewed and selected from 84 submissions. The papers feature original research in the areas of combinatorial optimization -- both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.

Graph Theory is a branch of discrete mathematics. It has many applications to many different areas of Science and Engineering. This book provides the most up-to-date research findings and applications in Graph Theory. This book focuses on the latest research in Graph Theory. It provides recent findings that are occurring in the field, offers insights on an international and transnational levels, identifies the gaps in the results, and includes forthcoming international studies and research, along with its applications in Networking, Computer Science, Chemistry, and Biological Sciences, etc. The book is written with researchers and post graduate students in mind.

This book covers the proceedings of the 4th International Conference on Energy Systems, Drives, and Automations (ESDA2021). It comprises interesting topics in renewable energy, power management, drives of electrical machines, and automation. It also discusses different tools and techniques to match the conference theme. This book also comprehensively discusses related tools and techniques and is a valuable resource for researchers and professionals in electrical and mechanical engineering disciplines.

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.

Improved by more than a dozen new exercises, an augmented section on labeling, the simplification of many proofs, and corrections suggested by classroom users and reviewers, this delightful text on graph theory retains and strengthens the appealing features of the original edition. It is an innovative and stimulating view of mathematics designed to appeal to teachers and students alike. Pearls in Graph Theory is based on twenty years of teaching by the leading researcher in graph theory. Unlike most texts on graph theory, this book is written in an informal style suitable for students in a variety of disciplines, though mathematics majors will find the material of sufficient depth and challenge. Covering major topics and theorems in graph theory, the text provides students with a solid foundation while keeping the material enjoyably accessible and entertaining. This course typically draws 50 to 70 students per year at the University of California, San Diego. The concrete nature of the topics, as well as the broad coverage of the field, allow the book to be used for a survey course at smaller schools with no undergraduate courses in graph theory. The only requirement is some mathematical maturity, about the level attained by a successful calculus student.