Fr. 200.00

Strongly Regular Graphs

English · Hardback

Shipping usually within 3 to 5 weeks

Description

Read more










This monograph on strongly regular graphs is an invaluable reference for anybody working in algebraic combinatorics.

List of contents










1. Graphs; 2. Polar spaces; 3. Graphs related to polar spaces; 4. Buildings; 5. Fischer spaces; 6. Golay codes, Witt designs, and Leech lattice; 7. Cyclotomic constructions; 8. Combinatorial constructions; 9. p-Ranks; 10. Individual graph descriptions; 11. Classification of rank 3 graphs; 12. Parameter table; References; Parameter Index; Author Index; Subject Index.

About the author

Andries E. Brouwer is Emeritus Professor at TU Eindhoven. He is the co-author of Distance Regular Graphs (1989), and the textbook Spectra of Graphs (2012). He received an honorary doctorate from Aalborg University, Denmark in 2004.H. Van Maldeghem is Senior Full Professor in the Department of Mathematics at Ghent University, Belgium. He is the author of Generalized Polygons (1998), co-author of Translation Generalized Quadrangles (2007) and co-editor of the Collected Works of Jacques Tits (2014). He received the Hall Medal from the ICA (1999), was an Erskine Fellow at the University of Canterbury and a Hood fellow in Auckland. He is a member of the Royal Flemish Academy of Belgium for Science and the Arts.

Summary

Strongly regular graphs are found in statistical design, finite group theory, coding theory and quantum information theory. This detailed survey of the theory and examples gathers the major results for the first time. It is an invaluable reference for researchers in graph theory, algebraic combinatorics, information theory and group theory.

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.