Combinatorics and graph theory

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

This book endeavors to deepen our understanding of lattice path combinatorics, explore key types of special sequences, elucidate their interconnections, and concurrently champion the author's interpretation of the "e;combinatorial spirit"e;.

This book covers the modelling of human behaviour in the education and labour markets, which due to their interdependency are viewed as one system.

A complete, accessible book on single and multiple output Boolean functions in cryptography and coding, with recent applications and problems.

Emphasizes a Problem Solving ApproachA first course in combinatoricsCompletely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems.

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups.

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

A textbook in combinatorics for second-year undergraduate to beginning graduate students.

The behaviour of river systems is a result of the complex interaction between flow, sediments, morphology and habitats.

A revised and updated version of popular textbook on abstract algebra, including new sections and numerous problems.

At the heart of modern cryptographic algorithms lies computational number theory.

The main aim of the book is to give a review of all relevant information regarding a well-known and important problem of Feedback Arc Set (FAS).

This textbook provides a comprehensive and reader-friendly introduction to the field of computational social science (CSS).

This book contains contributions presented at the 12th International Conference on Complex Networks (CompleNet), 24-26 May 2021.

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

An introduction to recent developments in algebraic combinatorics and an illustration of how research in mathematics actually progresses.

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

The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.

This is the first volume of the second edition of the standard text on design theory.

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field.

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 is a revised and updated version of the classic first edition.

This book contains contributions presented at the 12th International Conference on Complex Networks (CompleNet), 24-26 May 2021.

Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.

Coding theory came into existence in the late 1940s and is concerned with devising efficient encoding and decoding procedures.

This book is about graph energy.

A Beginner's Guide to Mathematical Proof prepares mathematics majors for the transition to abstract mathematics, as well as introducing a wider readership of quantitative science students, such as engineers, to the mathematical structures underlying more applied topics.

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.

This edited volume presents advances in modeling and computational analysis techniques related to networks and online communities.

This dedicated overview of optical compressive imaging addresses implementation aspects of the revolutionary theory of compressive sensing (CS) in the field of optical imaging and sensing.

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.

This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation.

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and ApplicationsThe Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing.

An Introduction to Grids, Graphs, and Networks aims to provide a concise introduction to graphs and networks at a level that is accessible to scientists, engineers, and students.

Introduces network inspired approaches for the analysis and integration of large, heterogeneous data sets in the life sciences.

Dieses Buch ist die erste fachübergreifende Einführung in die Kombinatorik in deutscher Sprache und umfasst Gesetzmäßigkeiten, Rechenregeln, Anwendungen sowie 50 Übungsaufgaben mit Lösungen.

Ramsey theory is a fascinating topic.

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

Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications.

This monograph presents combinatorial and numerical issues on integral quadratic forms as originally obtained in the context of representation theory of algebras and derived categories.

Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics.

This book provides a comprehensive introduction to the foundations and frontiers of graph neural networks.

These three lectures cover a certain aspect of complexity and black holes, namely the relation to the second law of thermodynamics.

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

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.

This book has arisen from a colloquium held at St.