ENGLISH

Distance-regular graphs

By Brouwer , Andries Evert; Neumaier , A.; Cohen , Arjeh M

Book information

Publisher
Springer-Verlag
Year
1989
ISBN
0387506195, 9780387506197, 9783540506195, 3540506195, 978-3-642-74343-6, 978-3-642-74341-2
DOI
10.1007/978-3-642-74341-2
Language
english
Format
DJVU
Filesize
6 MB (6252602 bytes)
Series
Ergebnisse der Mathematik und ihrer Grenzgebiete 3 Folge Bd. 18
Pages
495\512
Library
kolxoz
DPI
600
Time added
2016-05-22 07:20:00
Combinatorics; Group Theory and Generalizations; GControl; Calculus of Variations and Optimal Contro

Description

Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniqueness and the existence of many symmetries. This interplay between regularity and symmetry properties of graphs is the theme of this book. Starting from very elementary regularity properties, the concept of a distance-regular graph arises naturally as a common setting for regular graphs which are extremal in one sense or another. Several other important regular combinatorial structures are then shown to be equivalent to special families of distance-regular graphs. Other subjects of more general interest, such as regularity and extremal properties in graphs, association schemes, representations of graphs in euclidean space, groups and geometries of Lie type, groups acting on graphs, and codes are covered independently. Many new results and proofs and more than 750 references increase the encyclopaedic value of this book

Similar books