This volume provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
FREE Two-Day Shipping for students on millions of items. Learn more |
|
There is a newer edition of this item:
|
Book Description
Editorial Reviews
Book Description
This up-to-date survey of current research activity in several areas of combinatorics and its applications includes distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation.
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
A graph is distance regular if it is connected and, given any two vertices u and v at distance i, the number of vertices x at distance j from u and k from v is determined by the triple (i, j, k). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
halting node, triple regularity, exit frequencies, isospectral graphs, modular invariance property, orbit matrices, strong generating set, distance regular graph, recurrent positions, terminating game, triple occurs, strongly regular graphs, trivial automorphism group, ordinary matrix product, spin models, filling rule, starting distribution, translation bound, association schemes, link invariant, undirected case, switching class, threshold rule, triple systems, algebraic combinatorics Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, Theory Ser, New York, Lecture Notes, Academic Press, Foundations of Computer Science, Combinatorial Theory, Ars Combinatoria, Azuma's Inequality, Cambridge University Press, Theory of Computing, Computer Society Press, Kahn's Theorem, Reidemeister's Theorem New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
A graph is distance regular if it is connected and, given any two vertices u and v at distance i, the number of vertices x at distance j from u and k from v is determined by the triple (i, j, k). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
halting node, triple regularity, exit frequencies, isospectral graphs, modular invariance property, orbit matrices, strong generating set, distance regular graph, recurrent positions, terminating game, triple occurs, strongly regular graphs, trivial automorphism group, ordinary matrix product, spin models, filling rule, starting distribution, translation bound, association schemes, link invariant, undirected case, switching class, threshold rule, triple systems, algebraic combinatorics Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, Theory Ser, New York, Lecture Notes, Academic Press, Foundations of Computer Science, Combinatorial Theory, Ars Combinatoria, Azuma's Inequality, Cambridge University Press, Theory of Computing, Computer Society Press, Kahn's Theorem, Reidemeister's Theorem New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 23
books:
See all 23 books this book cites
1
book
cites this book:
- Computer Science: A Concise Introduction by Ian Robertson Sinclair on page 118, and page 153
- Random Graphs by Svante Janson on page 215, and page 230
- Adventures of a Mathematician by S. M. Ulam on page 41, and page 70
- Combinatorial Theory (Wiley Classics Library) by Marshall Hall on page 22, and page 212
- Triple Systems (Oxford Mathematical Monographs) by Charles J. Colbourn on page 25, and page 39
See all 23 books this book cites
- Permutation Groups (London Mathematical Society Student Texts) by Peter J. Cameron in Back Matter
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
