“…In addition, Kronenthal and Lazebnik [17] and Kronenthal, Lazebnik, and Williford [18] studied families of polynomial graphs over algebraically closed fields of characteristic zero and applied some of their techniques to graphs over finite fields; these results were recently extended by Cheng, Tang, and Xu [2]. Moreover, Kodess, Kronenthal, Manzano-Ruiz, and Noe [12] classified monomial graphs over the real numbers, and Ganger, Golden, Kronenthal, and Lyons [6] studied a two-dimensional analogue. A number of questions related to connectivity, diameter, and isomorphisms of similarly constructed directed graphs, as well as a peculiar result on the number of roots of certain polynomials in finite fields, were considered by Kodess [11], Kodess and Lazebnik [13,14], Kodess, Lazebnik, Smith, and Sporre [15], and Coulter, De Winter, Kodess, and Lazebnik [3].…”