Combinatorics and graph theory

Provides a unified understanding of the use of generating functions for labelled and unlabelled structures.

Following the introduction of Myspace, Linkedin and Facebook, social networks have become part of people's everyday life.

Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples.

The Encyclopedia of Social Network Analysis and Mining (ESNAM) is the first major reference work to integrate fundamental concepts and research directions in the areas of social networks and applications to data mining.

The book collects contributions from experts worldwide addressing recent scholarship in social network analysis such as influence spread, link prediction, dynamic network biclustering, and delurking.

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences.

This book provides a complete and comprehensive classification of normal 2-coverings of non-abelian simple groups and their generalizations.

This textbook offers a comprehensive introduction to the concepts underpinning our modern understanding of complex and emergent behavior.

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.

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

Thirty years after RSA was first publicized, it remains an active research area.

Many different fractal dimensions have been proposed for networks.

Complex Networks: An Algorithmic Perspective supplies the basic theoretical algorithmic and graph theoretic knowledge needed by every researcher and student of complex networks.

An important resource for all researchers with an interest in algebraic graph theory.

This volume examines state of the art research in finite geometries and designs.

From its origins in algebraic number theory, the theory of non-unique factorizations has emerged as an independent branch of algebra and number theory.

Around the globe, there is an increasingly urgent need to provide opportunities for learners to embrace complexity; to develop the many skills and habits of mind that are relevant to today's complex and interconnected world; and to make learning more connected to our rapidly changing workplace and society.

This text explores global methods in combinatorial optimization and is suitable for graduate students and researchers.

This book contains fundamental concepts on discrete mathematical structures in an easy to understand style so that the reader can grasp the contents and explanation easily.

This book depicts graph labelings that have led to thought-provoking problems and conjectures.

A modern, comprehensive review of abstract regular polytopes.

Quadratic Irrationals: An Introduction to Classical Number Theory gives a unified treatment of the classical theory of quadratic irrationals.

This textbook offers a comprehensive introduction to the concepts underpinning our modern understanding of complex and emergent behavior.

This interdisciplinary volume collects contributions from experts in their respective fields with as common theme diagrams.

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

Decomposing an abelian group into a direct sum of its subsets leads to results that can be applied to a variety of areas, such as number theory, geometry of tilings, coding theory, cryptography, graph theory, and Fourier analysis.

Applications of Group Theory to Combinatorics contains 11 survey papers from international experts in combinatorics, group theory and combinatorial topology.

This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations.

In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year.

The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature.

Updated to reflect current research, Algebraic Number Theory and Fermat's Last Theorem, Fourth Edition introduces fundamental ideas of algebraic numbers and explores one of the most intriguing stories in the history of mathematics-the quest for a proof of Fermat's Last Theorem.

This friendly introduction helps undergraduate students understand and appreciate matroid theory and its connections to geometry.

This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century.

In Mathematical Foundations of Public Key Cryptography, the authors integrate the results of more than 20 years of research and teaching experience to help students bridge the gap between math theory and crypto practice.

Fifty years ago, a new approach to reaction kinetics began to emerge: one based on mathematical models of reaction kinetics, or formal reaction kinetics.

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

We propose here a study of 'semiexact' and 'homological' categories as a basis for a generalised homological algebra.

This book provides a complete introduction into spatial networks.

Bringing the material up to date to reflect modern applications, this second edition has been completely rewritten and reorganized to incorporate a new style, methodology, and presentation.

The book will focus on exploiting state of the art research in semantic web and web science.

On the one side, Industrial competitiveness today means shorter product lifecycles, increased product variety, and shorter times to market and customized tangible products and services.

This book is concerned with the structure of linear semigroups, that is, subsemigroups of the multiplicative semigroup Mn(K) of n n matrices over a field K (or, more generally, skew linear semigroups - if K is allowed to be a division ring) and its applications to certain problems on associative algebras, semigroups and linear representations.

Today it appears that we understand more about the universe than about our interconnected socio-economic world.

This second edition of Lessons in Play reorganizes the presentation of the popular original text in combinatorial game theory to make it even more widely accessible.

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.

Magic and antimagic labelings are among the oldest labeling schemes in graph theory.

Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design.