Preface

Abstract

This chapter presents a wide scope of random graphs subjects such as properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matching's, hamiltonian cycles, and closure in such structures. In addition, it also illustrates various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs, and reliability of planar networks.