Combinatorics and graph theory

This book builds on two recently published books by the same authors on fuzzy graph theory.

This book introduces new methods to analyze vertex-varying graph signals.

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

This book describes new theories and applications of artificial neural networks, with a special focus on addressing problems in neuroscience, biology and biophysics and cognitive research.

This text provides a theoretical background for several topics in combinatorial mathematics, such as enumerative combinatorics (including partitions and Burnside's lemma), magic and Latin squares, graph theory, extremal combinatorics, mathematical games and elementary probability.

The most recent methods in various branches of lattice path and enumerative combinatorics along with relevant applications are nicely grouped together and represented in this research contributed volume.

This contributed book has a comprehensive collection of 17 carefully curated chapters that delve into the latest advancements in fixed-point theory and its diverse applications.

Boolean Structures: Combinatorics, Codification, Representation offers the first analytical and architectural approach to Boolean algebras based combinatorial calculus and codification with applications in IT, quantum information and classification of data.

Designed for advanced undergraduate and beginning graduate students in linear or abstract algebra, Advanced Linear Algebra covers theoretical aspects of the subject, along with examples, computations, and proofs.

This monograph identifies polytopes that are "e;combinatorially embeddable"e;, within interesting lists of polytopal graphs, i.

The book is the first to give a comprehensive overview of the techniques and tools currently being used in the study of combinatorial problems in Coxeter groups.

A Mathematical Tour introduces readers to a selection of mathematical topics chosen for their centrality, importance, historical significance, and intrinsic appeal and beauty.

The main goal of our book is to provide easy access to the basic principles and methods that combinatorial calculations are based upon.

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

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

Designed for advanced undergraduate and beginning graduate students in linear or abstract algebra, Advanced Linear Algebra covers theoretical aspects of the subject, along with examples, computations, and proofs.

This book describes Python3 programming resources for implementing decision aiding algorithms in the context of a bipolar-valued outranking approach.

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

This combinatorics text provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries.

Group theory appears to be a promising source of hard computational problems for deploying new cryptographic constructions.

Combinatorial theory is one of the fastest growing areas of modern mathematics.

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory.

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

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

Aspects of Integration: Novel Approaches to the Riemann and Lebesgue Integrals is comprised of two parts.

Aspects of Integration: Novel Approaches to the Riemann and Lebesgue Integrals is comprised of two parts.

The second edition of this well-received textbook is devoted to Combinatorics and Graph Theory, which are cornerstones of Discrete Mathematics.

How can one be assured that computer codes that solve differential equations are correct?

Non-Newtonian Sequence Spaces with Applications presents an alternative to the usual calculus based on multiplication instead of addition.

Combinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics.

Combinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics.

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

Geometric Data Analysis designates the approach of Multivariate Statistics that conceptualizes the set of observations as a Euclidean cloud of points.

What Is Combinatorics Anyway?

What Is Combinatorics Anyway?

The first part of this book introduces the Schubert Cells and varieties of the general linear group Gl (k^(r+1)) over a field k according to Ehresmann geometric way.

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.

Introduction to Radar Analysis, Second Edition is a major revision of the popular textbook.

Introduction to Radar Analysis, Second Edition is a major revision of the popular textbook.

Algorithmics of Nonuniformity is a solid presentation about the analysis of algorithms, and the data structures that support them.

Crossing Numbers of Graphs is the first book devoted to the crossing number, an increasingly popular object of study with surprising connections.

This book covers both theoretical and practical results for graph polynomials.

The Rogers--Ramanujan identities are a pair of infinite series-infinite product identities that were first discovered in 1894.

The Handbook of Geometric Constraint Systems Principles is an entry point to the currently used principal mathematical and computational tools and techniques of the geometric constraint system (GCS).

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.

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

Introduction to Abstract Algebra, Second Edition presents abstract algebra as the main tool underlying discrete mathematics and the digital world.

Introduction to Abstract Algebra, Second Edition presents abstract algebra as the main tool underlying discrete mathematics and the digital world.

Discrete Mathematics and Applications, Second Edition is intended for a one-semester course in discrete mathematics.