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.

Скачать книгу бесплатно (djvu, 823 Kb)

---

Читать «Graphs, codes and designs»