Böcker i De Gruyter Series in Discrete Mathematics and Applications-serien

This series is devoted to the publication of high-level monographs which cover the whole spectrum of current discrete mathematics and its applications in various fields. One of its main objectives is to make available to the professional community expositions of results and foundations of methods that play an important role in both the theory and applications of discrete mathematics.

Written for mathematicians working with the theory of graph spectra, this (primarily theoretical) book presents relevant results considering the spectral properties of regular graphs. The book begins with a short introduction including necessary terminology and notation. The author then proceeds with basic properties, specific subclasses of regular graphs (like distance-regular graphs, strongly regular graphs, various designs or expanders) and determining particular regular graphs. Each chapter contains detailed proofs, discussions, comparisons, examples, exercises and also indicates possible applications. Finally, the author also includes some conjectures and open problems to promote further research. ContentsSpectral propertiesParticular types of regular graphDeterminations of regular graphsExpandersDistance matrix of regular graphs

Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise in a wide variety of important fields such as transportation, telecommunications, computer networking, location, planning, distribution problems, etc. Important and significant results have been obtained on the theory, algorithms and applications over the last few decades. In combinatorial optimization, many network design problems can be generalized in a natural way by considering a related problem on a clustered graph, where the original problem's feasibility constraints are expressed in terms of the clusters, i.e., node sets instead of individual nodes. This class of problems is usually referred to as generalized network design problems (GNDPs) or generalized combinatorial optimization problems. The express purpose of this monograph is to describe a series of mathematical models, methods, propositions, algorithms developed in the last years on generalized network design problems in a unified manner. The book consists of seven chapters, where in addition to an introductory chapter, the following generalized network design problems are formulated and examined: the generalized minimum spanning tree problem, the generalized traveling salesman problem, the railway traveling salesman problem, the generalized vehicle routing problem, the generalized fixed-charge network design problem and the generalized minimum vertex-biconnected network problem. The book will be useful for researchers, practitioners, and graduate students in operations research, optimization, applied mathematics and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will find this book useful, too.