Random graphs
Series: Cambridge studies in advanced mathematics ; 73Publication details: Cambridge University Press, 2001. New Delhi:Edition: 2nd edDescription: xviii, 498 p. : ill. ; pb, 24 cmISBN:- 9780521170031
- 511.5 BOL
Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
Books | IIT Gandhinagar General Stacks | General | 511.5 BOL (Browse shelf(Opens below)) | 1 | Available | 030187 |
Includes bibliographical references and index.
In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.
There are no comments on this title.