Graphs Matrices And Designs

Examines partitions and covers of graphs and digraphs, latin squares, pairwise balanced designs with prescribed block sizes, ranks and permanents, extremal graph theory, Hadamard matrices and graph factorizations. This book is designed to be of interest to applied mathematicians, computer scientists and communications researchers.

An introduction to a powerful and flexible network modeling tool for developing and understanding complex systems, with many examples from a range of industries. Design structure matrix (DSM) is a straightforward and flexible modeling technique that can be used for designing, developing, and managing complex systems. DSM offers network modeling tools that represent the elements of a system and their interactions, thereby highlighting the system's architecture (or designed structure). Its advantages include compact format, visual nature, intuitive representation, powerful analytical capacity, and flexibility. Used primarily so far in the area of engineering management, DSM is increasingly being applied to complex issues in health care management, financial systems, public policy, natural sciences, and social systems. This book offers a clear and concise explanation of DSM methods for practitioners and researchers.

This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reorganized. Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory, it will also benefit readers in the sciences and engineering.

This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics.

This collection of four short courses looks at group representations, graph spectra, statistical optimality, and symbolic dynamics, highlighting their common roots in linear algebra. It leads students from the very beginnings in linear algebra to high-level applications: representations of finite groups, leading to probability models and harmonic analysis; eigenvalues of growing graphs from quantum probability techniques; statistical optimality of designs from Laplacian eigenvalues of graphs; and symbolic dynamics, applying matrix stability and K-theory. An invaluable resource for researchers and beginning Ph.D. students, this book includes copious exercises, notes, and references.

These are notes deriving from lecture courses on the theory of t-designs and graph theory given by the authors in 1973 at Westfield College, London.

Over the last several years, there has been a significant increase in compu tational combinatorics. The most widely reported results were, of course, the proof of the Four Color Theorem and the proof that there is no projective plane of parameter 10. Although the computer was essential in both proofs, the only reason for this was the fact that life is short. The computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were just longer. Another important fact to notice is that both problems were theoretical, pure mathematical ones. The pursuit of the Four-Color Theorem has led to the development of whole branches of graph theory. The plane of parameter 10 is not an isolated case; its nonexistence is the first (and so far, the only) coun terexample to the conjecture that the Bruck-Chowla-Ryser conditions were necessary and sufficient for the existence of a symmetric balanced incomplete block design; the study of this problem has also led to a number of theoretical advances, including investigation of the relationship between codes and designs.