Distance-Regular Graphs
Our rough guess is there are 130,000 words in this book.
At a pace averaging 250 words per minute, this book will take 8 hours and 40 minutes to read. With a half hour per day, this will take 18 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Publication
2012 - Springer
Language
English
Word Count
130,000 words, Guess
Page Count
520 pages
Identifiers
- ISBN-139783642743412
- ISBN-103642743412
- Better World Books9783642743412
- Open LibraryOL34882892M
Classifications
- LCCQA1-939
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.
Subjects
Other Editions
- Distance-Regular Graphs
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!