Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, rela...

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. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on construct...

This reader-friendly textbook is the first work of its kind to provide a unified Introduction to Computational Social Science (CSS). Four distinct methodological approaches are examined in detail, namely automated social information extraction, social network analysis, social complexity theory and social simulation modeling. The coverage of these approaches is supported by a discussion of the historical context, as well as by a list of texts for further reading. Features: highligh...

Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (...

This book features 13 papers presented at the Fifth International Symposium on Recurrence Plots, held August 2013 in Chicago, IL. It examines recent applications and developments in recurrence plots and recurrence quantification analysis (RQA) with special emphasis on biological and cognitive systems and the analysis of coupled systems using cross-recurrence methods.Readers will discover new applications and insights into a range of systems provided by recurrence plot analysis and ...

This undergraduate textbook provides an introduction to graph theory, which has numerous applications in modeling problems in science and technology, and has become a vital component to computer science, computer science and engineering, and mathematics curricula of universities all over the world.The author follows a methodical and easy to understand approach. Beginning with the historical background, motivation and applications of graph theory, the author first explains basic gra...

From the reviews of the previous editions".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at ...

Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergraduate mathematics students, and provides them with many of the basic techniques, ideas and results. It contains many worked examples, and each chapter ends with a large number of exercises, with h...

This book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory. In the literature hypergraphs have many other names such as set systems and families of sets. This work presents the theory of hypergraphs in its most original aspects, while also introducing and assessing the latest concepts on hypergraphs. The variety of topics, their originality and novelty are intended to help readers better understand the hypergraphs in all their...

This textbook provides an introduction to the Catalan numbers and their remarkable properties, along with their various applications in combinatorics. Intended to be accessible to students new to the subject, the book begins with more elementary topics before progressing to more mathematically sophisticated topics. Each chapter focuses on a specific combinatorial object counted by these numbers, including paths, trees, tilings of a staircase, null sums in Zn+1, interval structures, partiti...

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some o...