Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper we explore a natural multiplicative-additive analogue of such arising from vector spaces fields. Namely, if n≥2 U⊊Fqn is an Fq-vector space, GU (undirected) graph with vertex set V(GU)=Fqn edge E(GU)={(a,b)∈Fqn2|a≠b,ab∈U}. We describe structure arbitrary maximal clique provide bounds on number ω...