Combinatorics and graph theory

This 1997 book explores the role of probabilistic methods for solving combinatorial problems.

Across the Board is the definitive work on chessboard problems.

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.

Through three editions, Cryptography: Theory and Practice, has been embraced by instructors and students alike.

Over a career that spanned 60 years, Ronald L.

This book is the first systematic study of graphical enumeration and the asymptotic algebraic structures in perturbative quantum field theory.

Eschewing the often standard dry and static writing style of traditional textbooks, Discrete Encounters provides a refreshing approach to discrete mathematics.

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations.

This expanded edition of the classic work on empirical processes now boasts several new proved theorems not in the first.

More than 250 exercises and solutions on properties and applications of Catalan numbers, at levels ranging from recreational to research.

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

This book collects papers presented at the International Conference on Mathematical Modelling and Computational Intelligence Techniques (ICMMCIT) 2021, held at the Department of Mathematics, The Gandhigram Rural Institute (Deemed to be University), Gandhigram, Tamil Nadu, India, from 10-12 February 2021.

Cryptology: Classical and Modern, Second Edition proficiently introduces readers to the fascinating field of cryptology.

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

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.

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks.

The volume presents, in a synergistic manner, significant theoretical and practical contributions in the area of social media reputation and authorship measurement, visualization, and modeling.

This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable these systems to handle advanced graph algorithms efficiently.

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 book is a useful, attractive introduction to basic counting techniques for upper secondary and junior college students, as well as teachers.

The book focuses on Social Collective Intelligence, a term used to denote a class of socio-technical systems that combine, in a coordinated way, the strengths of humans, machines and collectives in terms of competences, knowledge and problem solving capabilities with the communication, computing and storage capabilities of advanced ICT.

This textbook teaches control theory for multi-agent systems.

This book provides international perspective for those studying or working in the security domain, from enforcement to policy.

Die Graphentheorie gehört zu den Gebieten der Mathematik, die sich heute am stärksten entwickeln, zum Teil angestoßen durch Erfordernisse der Praxis, aber auch aus rein mathematischem Interesse.

A practical introduction to network science for students across business, cognitive science, neuroscience, sociology, biology, engineering and other disciplines.

Unlike most elementary books on matrices, A Combinatorial Approach to Matrix Theory and Its Applications employs combinatorial and graph-theoretical tools to develop basic theorems of matrix theory, shedding new light on the subject by exploring the connections of these tools to matrices.

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

In the two-volume set 'A Selection of Highlights' we present basics of mathematics in an exciting and pedagogically sound way.

The volume is a collection of 20 refereed articles written in connection with lectures presented at the 12th International Conference on Finite Fields and Their Applications ('Fq12') at Skidmore College in Saratoga Springs, NY in July 2015.

Marking 94 years since its first appearance, this book provides an annotated translation of Sainte-Lague's seminal monograph Les reseaux (ou graphes), drawing attention to its fundamental principles and ideas.

The present work is meant as a reference to provide an organic and comprehensive view of the most relevant results in the exciting new field of Networks of Networks (NetoNets).

Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory.

This book is based on the outcome of the "e;2012 Interdisciplinary Symposium on Complex Systems"e; held at the island of Kos.

The authors discuss comprehensively the generalization of results and applications to quasi-symmetric designs.

The second edition of a successful and unique textbook for students in mathematics or theoretical computer science.

This proceedings is focused on the emerging concept of Collaborative Innovation Networks (COINs).

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.

Developed from the authors' courses at Syracuse University and the U.

Discrete Event Simulation is a process-oriented text/reference that utilizes an eleven-step model to represent the simulation process from problem formulation to implementation and documentation.

Graph algebras possess the capacity to relate fundamental concepts of computer science, combinatorics, graph theory, operations research, and universal algebra.

The continuation of an outstanding scholarly attempt to bring together all significant mathematical constants in one place.

This second volume in a two-volume series provides an extensive collection of conjectures and open problems in graph theory.

This book presents methods for the summation of infinite and finite series and the related identities and inversion relations.

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

As discrete mathematics rapidly becomes a required element of undergraduate mathematics programs, algebraic software systems replace compiled languages and are now most often the computational tool of choice.

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

Conveying ideas in a user-friendly style, this book has been designed for a course in Applied Algebra.

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.