Since $G(n,k,0)$ are called Kneser graphs and $G(n,k,k-1)$ are called Johnson graphs, it makes sense to call $G(n,k,t)$ the generalized Kneser graphs or the generalized Johnson graphs. I prefer to refer to $G(n,k,t)$ as the generalized Johnson graphs because then the generalized Kneser graphs can be reserved to refer to the family of graphs $G(n,k, \le s)$. This latter graph is defined to be the graph whose vertices are the $k$-subsets of an $n$-set, with two vertices joined iff the cardinality of their intersection is at most $s$. The special case $s=0$ gives the Kneser graphs, so the terminology generalized Kneser graphs is justified for $G(n,k, \le s$). These graphs have also been studied - for eg, in the papers [Chen and Wang, Discrete Math., 2008] and [Denley, Eur. J. Comb, 1997].

In the literature, the graphs $G(n,k,t)$ have been called the generalized Johnson graphs (see the paper at arxiv.org/pdf/1202.3455.pdf, or the SAGE code on Godsil's website) or uniform subset graphs (see the papers of [Chen and Lih, JCTB, 1987] and [Chen and Wang, Discrete Math., 2008]). I prefer to use the phrase "uniform" to just refer to the fact that the edges of a hypergraph all have the same cardinality (for eg, independent sets in $G(n, k, \le s)$ refer to $k$-uniform $(s+1)$-intersecting families in the set of subsets of an $n$-set). So I now call $G(n,k,t)$ the generalized Johnson graphs.