A simple and systematic procedure for the synthesis of a fundamental cutset matrix of a nonoriented graph is presented. The synthesis procedure is based on finding a cutset matrix Afs which has the property that a row in Afs corresponding to an incidence set has Vs nonzero entries where Vs corresponds to the number of rows in Afs. The method uses the results obtained by Mayeda and Iri.