Résumé : The notion of quasi-random graphs was introduced in 1987 by F. R. K. Chung, R. L. Graham and R. M. Wilson, resp. A. Thomason. It has been shown that there is a strong connection between this notion and the pseudorandomness of (finite) binary sequences. This connection can be utilized for constructing large families of quasi-random graphs by considering graphs defined by a circular adjacency matrix whose first column is a binary sequence with strong pseudo-random properties. Starting out from this construction principle one may extend, generalize and sharpen some definitions and results on quasi-randomness of graphs.

Mots-Clés : graph properties; random graphs; quasi-randomness; quasi-random graph; binary sequence; pseudorandomness