Combinatorics and graph theory

Der Tod ist die einzige Gewissheit des Lebens.

Modern cryptography has evolved dramatically since the 1970s.

The contributions included in the volume are drawn from presentations at ODS2019 - International Conference on Optimization and Decision Science, which was the 49th annual meeting of the Italian Operations Research Society (AIRO) held at Genoa, Italy, on 4-7 September 2019.

This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume.

 This proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021.

The Rogers--Ramanujan identities are a pair of infinite series-infinite product identities that were first discovered in 1894.

In 1974 the editors of the present volume published a well-received book entitled ``Latin Squares and their Applications'.

Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas.

A timely book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications, most notably in data compression and computational molecular biology.

?

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.

This book explores the inequalities for eigenvalues of the six matrices associated with graphs.

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.

One of the most preeminent ways of applying mathematics in real-world scenario modeling involves graph theory.

RC4 Stream Cipher and Its Variants is the first book to fully cover the popular software stream cipher RC4.

A treatment of cutting-edge research on the distribution modulo one of sequences and related topics, with exercises and open problems.

The book includes both invited and contributed chapters dealing with advanced methods and theoretical development for the analysis of social networks and applications in numerous disciplines.

This concise monograph present the complete history of the domination game and its variants up to the most recent developments and will stimulate research on closely related topics, establishing a key reference for future developments.

A graduate-level introduction to finite geometry and its applications to other areas of combinatorics.

Explore the mathematics arising from discrete quantum walks in this introduction to a rapidly developing area.

This book addresses the challenging topic of modeling adaptive networks, which often manifest inherently complex behavior.

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory.

Introduction to Enumerative and Analytic Combinatorics fills the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.

Near Rings, Fuzzy Ideals, and Graph Theory explores the relationship between near rings and fuzzy sets and between near rings and graph theory.

In the present era dominated by computers, graph theory has come into its own as an area of mathematics, prominent for both its theory and its applications.

Since Hopfield proposed neural network computing for optimization and combinatorics problems, many neural network investigators have been working on optimization problems.

The main interest of this research has been in understanding and characterizing large networks of human interactions as continuously changing objects.

This proceedings volume gathers selected, revised papers presented at the 51st Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2020), held at Florida Atlantic University in Boca Raton, USA, on March 9-13, 2020.

This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses.

Current interest in fractal dimensions of networks is the result of more than a century of previous research on dimensions.

This book is the very first one in the English language entirely dedicated to the Lambert W function, its generalizations, and its applications.

Spatio-temporal networks (STN)are spatial networks whose topology and/or attributes change with time.

The definitive treatment of analytic combinatorics, from leaders in the field.

Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition.

This book provides two conceptual frameworks for further investigation of map literacy and fills in a gap in map literacy studies, addressing the distinction between reference maps and thematic maps and the varying uses of quantitative map literacy (QML) within and between the two.

This volume, first published in 1999, is a valuable resource on combinatorics for graduate students and researchers.

This book is a timely collection of chapters that present the state of the art within the analysis and application of big data.

The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks.

This volume presents a unified and coherent account of the many and various parts of general recursion theory.

Combinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics.

This book deals with the analysis of the structure of complex networks by combining results from graph theory, physics, and pattern recognition.

Designed for advanced undergraduate and beginning graduate students in linear or abstract algebra, Advanced Linear Algebra covers theoretical aspects of the subject, along with examples, computations, and proofs.

Simulating for a crisis is far more than creating a simulation of a crisis situation.

Complexity occurs in biological and synthetic systems alike.

This book is a useful, attractive introduction to basic counting techniques for upper secondary and junior college students, as well as teachers.

This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information.

A Tour Through Graph Theory introduces graph theory to students who are not mathematics majors.