Combinatorics and graph theory

This book focuses on the emergence of creative ideas from cognitive and social dynamics.

This proceedings book presents state-of-the-art developments in theory, methodology, and applications of network analysis across sociology, computational science, education research, literature studies, political science, international relations, social media research, and urban studies.

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 book aims to explain how collective behavior is formed via local interactions under imperfect communication in complex networked systems.

A CHOICE "e;Outstanding Academic Title,"e; the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations.

This volume comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results.

Number theory has a rich history.

Survey articles based on the invited lectures given at the 23rd British Combinatorial Conference.

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians.

The present book is based on the curriculum of undergraduate and postgraduate courses of universities in India and abroad.

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics.

In the rapidly evolving domain of computational problem-solving, this book delves into the cutting-edge Automatic Generation of Algorithms (AGA) paradigm, a groundbreaking approach poised to redefine algorithm design for optimization problems.

Comprehensive coverage of recent, exciting developments in Fourier restriction theory, including applications to number theory and PDEs.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises.

Maps are beguilingly simple structures with deep and ubiquitous properties.

Written to honor the enduring influence of William Fulton, these articles present substantial contributions to algebraic geometry.

The Tutte Polynomial touches on nearly every area of combinatorics as well as many other fields, including statistical mechanics, coding theory, and DNA sequencing.

Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory.

Contains graduate-level introductions by international experts to five areas of research in orthogonal polynomials and special functions.

This monograph presents the state-of-the-art developments in the design of behaviorally and structurally optimal livenessen-forcing Petri net supervisors with computationally tractable approaches.

This brief investigates the asymptotic behavior of some PDEs on networks.

This book is designed to be usable as a textbook for an undergraduate course or for an advanced graduate course in coding theory as well as a reference for researchers in discrete mathematics, engineering and theoretical computer science.

Graph Theory and Its Applications, Third Edition is the latest edition of the international, bestselling textbook for undergraduate courses in graph theory, yet it is expansive enough to be used for graduate courses as well.

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).

A graduate-level 2006 text bringing together the tools from different fields used in additive combinatorics.

This book provides an extensive set of tools for applying fuzzy mathematics and graph theory to real-life problems.

The concept of temporal networks is an extension of complex networks as a modeling framework to include information on when interactions between nodes happen.

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports.

This original research monograph concerns various aspects of how (based on the decompositions of vertices of hypercube graphs with respect to their symmetric cycles) the vertex sets of related discrete hypercubes, as well as the power sets of the corresponding ground sets, emerge from rank 2 oriented matroids, from underlying rank 2 systems of linear inequalities, and thus literally from arrangements of straight lines crossing a common point on a piece of paper.

This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes.

This book presents a topological approach to combinatorial configurations, in particular graphs, by introducing a new pair of homology and cohomology via polyhedra.

Corporations, and the environments in which they operate, are complex, with changing multiple dimensions, and an inherent capacity to evolve qualitatively.

Dynamical models on graphs or random graphs are increasingly used in applied sciences as mathematical tools to study complex systems whose exact structure is too complicated to be known in detail.

Introduction to Number Theory is a classroom-tested, student-friendly text that covers a diverse array of number theory topics, from the ancient Euclidean algorithm for finding the greatest common divisor of two integers to recent developments such as cryptography, the theory of elliptic curves, and the negative solution of Hilbert's tenth problem.

This book offers an introduction to the theory of groupoids and their representations encompassing the standard theory of groups.

This collection of contributed chapters demonstrates a wide range of applications within two overlapping research domains: social media analysis and social network analysis.

Aimed at graduate students and researchers in enumerative combinatorics, this book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective.

On the surface, matrix theory and graph theory seem like very different branches of mathematics.

This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other.

This new handbook on radar signal analysis adopts a deliberate and systematic approach.

A beginning graduate level treatment of elliptic functions with a huge array of examples, first published in 2006.

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 aims to bring together researchers and practitioners from diverse disciplines-from sociology, biology, physics, and computer science-who share a passion to better understand the interdependencies within and across systems.

A lively invitation to the flavor, elegance, and power of graph theory This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references.

This volume contains selected refereed papers based on lectures presented at the 'Integers Conference 2007', an international conference in combinatorial number theory that was held in Carrollton, Georgia in October 2007.

Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools.

Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis.