Function-described graphs (FDGs) have been introduced very recently as a representation of an ensemble of attributed relational graphs (ARGs) for structural pattern recognition 1, 2]. In this paper, the relationship between FDGs and Random Graphs 3] is analysed and the synthesis process of FDGs is studied, whereas the matching process between FDGs and ARGs is discussed elsewhere 4]. Two procedu...