This book explores topics in Gallai-Ramsey theory, which looks into whether rainbow colored subgraphs or monochromatic subgraphs exist in a sufficiently large edge-colored complete graphs.
Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity.
This book uses literature as a wrench to pry open social networks and to ask different questions than have been asked about social networks previously.
The most recent methods in various branches of lattice path and enumerative combinatorics along with relevant applications are nicely grouped together and represented in this research contributed volume.
The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields.
The aim of this book is to advocate and promote network models of linguistic systems that are both based on thorough mathematical models and substantiated in terms of linguistics.
Introduction to Recognition and Deciphering of Patterns is meant to acquaint STEM and non-STEM students with different patterns, as well as to where and when specific patterns arise.
This book delves into the foundational principles governing the treatment of molecular networks and "e;chemical space"e;-the comprehensive domain encompassing all physically achievable molecules-from the perspectives of vector space, graph theory, and data science.
The mathematical study of games is an intriguing endeavor with implications and applications that reach far beyond tic-tac-toe, chess, and poker to economics, business, and even biology and politics.
This comprehensive introductory textbook is designed for undergraduate mathematics students who are interested in gaining an in-depth understanding of fuzzy mathematics and its applications.
A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel Research Directions Focusing on a very active area of research in the last decade, Combinatorics of Compositions and Words provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words.
Focused on the mathematical foundations of social media analysis, Graph-Based Social Media Analysis provides a comprehensive introduction to the use of graph analysis in the study of social and digital media.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications.
This brief examines mathematical models in nonsmooth mechanics and nonregular electrical circuits, including evolution variational inequalities, complementarity systems, differential inclusions, second-order dynamics, Lur'e systems and Moreau's sweeping process.
Vector Partitions, Visible Points and Ramanujan Functions offers a novel theory of Vector Partitions, though very much grounded in the long-established work of others, that could be developed as an extension to the existing theory of Integer Partitions.
Discrete Mathematics: An Open Introduction, Fourth Edition aims to provide an introduction to select topics in discrete mathematics at a level appropriate for first or second year undergraduate math and computer science majors, especially those who intend to teach middle and high school mathematics.
Methods Used to Solve Discrete Math ProblemsInteresting examples highlight the interdisciplinary nature of this areaPearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures.
Whether you are looking for an introduction to the field of tree balance, a reference work on the multitude of available balance indices or inspiration for your future research, this book offers all three.
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
This book aims to bring together researchers and practitioners working across domains and research disciplines to measure, model, and visualize complex networks.
