Combinatorics and graph theory

Survey articles based on the invited lectures given at the Twenty-second British Combinatorial Conference.

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdos (1913-1996), one of the most versatile and prolific mathematicians of our time.

This is the most readable and thorough graduate textbook and reference for combinatorics, covering enumeration, graphs, sets, and methods.

Geometry of Derivation with Applications is the fifth work in a longstanding series of books on combinatorial geometry (Subplane Covered Nets, Foundations of Translation Planes, Handbook of Finite Translation Planes, and Combinatorics of Spreads and Parallelisms).

Construct, analyze, and visualize networks with networkx, a Python language module.

This book introduces the fundamental concepts of homomorphic encryption.

Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction.

This book aims to bring together researchers and practitioners working across domains and research disciplines to measure, model, and visualize complex networks.

This book introduces oriented version of metrics and cuts and their multidimensional analogues, as well as partial metrics and weighted metrics.

This book is designed to meet the requirement of undergraduate and postgraduate students pursuing computer science, information technology, mathematical science, and physical science course.

A unique approach illustrating discrete distribution theory through combinatorial methods This book provides a unique approach by presenting combinatorial methods in tandem with discrete distribution theory.

The book reviews inequalities for weighted entry sums of matrix powers.

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.

?

This book focuses on the theoretical side of temporal network research and gives an overview of the state of the art in the field.

In knot theory, diagrams of a given canonical genus can be described by means of a finite number of patterns ("e;generators"e;).

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms.

This proceedings volume compiles selected, revised papers presented at the 53rd SouthEastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC 2022), which took place at Florida Atlantic University in Boca Raton, USA, from March 7th to 11th, 2022.

This book collects selected, peer-reviewed research presented at the 8th International Conference on Mathematics: Pure, Applied, and Computation, held in Lombok, Indonesia, on 30 September 2023.

Mahler measure, a height function for polynomials, is the central theme of this book.

The lastdecades have seen the emergence of Complex Networks as the language with whicha wide range of complex phenomena in fields as diverse as Physics, ComputerScience, and Medicine (to name just a few) can be properly described andunderstood.

Chapters "e;On the Current State of Reproducibility and Reporting of Uncertainty for Aspect-Based SentimentAnalysis"e; and "e;Contextualized Graph Embeddings for Adverse Drug Event Detection"e; are licensed under theterms of the Creative Commons Attribution 4.

This award-winning textbook targets the gap between introductory texts in discrete mathematics and advanced graduate texts in enumerative combinatorics.

Contemporary students of mathematics differ considerably from those of half a century ago.

Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope.

An introduction to enumerative combinatorics, vital to many areas of mathematics.

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.

Beginning with its origins in the pioneering work of W.

Current developments in air pollution modelling are explored as a series of contributions from researchers at the forefront of their field.

The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates.

The text covers random graphs from the basic to the advanced, including numerous exercises and recommendations for further reading.

This edited volume offers a detailed account of the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic.

Number theory has a rich history.

This book is an introduction to maximum-entropy models of random graphs with given topological properties and their applications.

This book reports on advanced concepts in fuzzy graph theory, showing a set of tools that can be successfully applied to understanding and modeling illegal human trafficking.

This brief focuses on introducing a novel mathematical framework, referred as hypergraph theory, to model and solve the multiple interferer scenarios for future wireless communication networks.

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.

Building on the author's previous book in the series, Complex Analysis with Applications to Flows and Fields (CRC Press, 2010), Transcendental Representations with Applications to Solids and Fluids focuses on four infinite representations: series expansions, series of fractions for meromorphic functions, infinite products for functions with infinit

Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics.

In the context of coupled-coordination control mechanisms, this book focuses on the delay robustness of consensus problems with asynchronously coupled and synchronously coupled consensus algorithms respectively.

This book is a tribute to Paul Erd\H{o}s, the wandering mathematician once described as the "e;prince of problem solvers and the absolute monarch of problem posers.

Second edition of a popular text which covers the whole field of combinatorics.

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors.

This book offers an introduction to some combinatorial (also, set-theoretical) approaches and methods in geometry of the Euclidean space Rm.

This book contains volumes 1-3 of the Journal of Graph Algorithms and Applications (JGAA).

This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.

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

How many ways do exist to mix different ingredients, how many chances to win a gambling game, how many possible paths going from one place to another in a network ?