In this talk I will present a simple method for constructing infinite families of graphs defined by a class of systems of equations over commutative rings. In many instances, specializations of these constructions over finite fields have proved useful in various problems of extremal graph theory, and they also found applications in coding theory and cryptography. I will explain motivations for these constructions, survey both old and new related results, and state some related open questions.