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.

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.

This is an open access book. It is with great pleasure and honor to announce The 6th International Conference of Combinatorics, Graph Theory, and Network Topology which will be held from 15th – 16th November 2022 in the University of Jember, East Java, Indonesia. It is the fifth international conference organized by CGANT. It is the sixth international conference organized by CGANT Research Group University of Jember in cooperation with Indonesian Combinatorics Society (INACOBMS). The conference is held to welcome participants from many countries, with broad and diverse research interests of mathematics especially combinatorical study. The mission is to become an annual international forum in the future, where, civil society organization and representative, research students, academics and researchers, scholars, scientist, teachers and practitioners from all over the world could meet in and exchange an idea to share and to discuss theoretical and practical knowledge about mathematics and its applications. The aim of the sixth conference is to present and discuss the latest research that contributes to the sharing of new theoretical, methodological and empirical knowledge and a better understanding in the area mathematics, application of mathematics as well as mathematics education.

This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

This book presents best selected research papers presented at the 4th International Conference on Cognitive Informatics and Soft Computing (CISC 2021), held at Balasore College of Engineering & Technology, Balasore, Odisha, India, from 21–22 August 2021. It highlights, in particular, innovative research in the fields of cognitive informatics, cognitive computing, computational intelligence, advanced computing, and hybrid intelligent models and applications. New algorithms and methods in a variety of fields are presented, together with solution-based approaches. The topics addressed include various theoretical aspects and applications of computer science, artificial intelligence, cybernetics, automation control theory, and software engineering.

"Fans will find this volume indispensable; casual readers will find it an attractive nuisance," observed Scientific American of this challenging compilation of conundrums, diabolic squares, flexagons, geometric dissections, other puzzles.

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

Upon publication, the first edition of the CRC Concise Encyclopedia of Mathematics received overwhelming accolades for its unparalleled scope, readability, and utility. It soon took its place among the top selling books in the history of Chapman & Hall/CRC, and its popularity continues unabated. Yet also unabated has been the d

This book constitutes the thoroughly refereed post-proceedings of the Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003, held in Bandung, Indonesia in September 2003. The 23 revised papers presented were carefully selected during two rounds of reviewing and improvement. Among the topics covered are coverings, convex polygons, convex polyhedra, matchings, graph colourings, crossing numbers, subdivision numbers, combinatorial optimization, combinatorics, spanning trees, various graph characteristica, convex bodies, labelling, Ramsey number estimation, etc.