Gaussian graphical models are multivariate Gaussian statistical models in which a graph encodes conditional independence relations among the random variables. Adding colors to this graph allows us to describe situations where some entries in the concentration matrices in the model are assumed to be equal. In this talk, we focus on RCOP models, in which this coloring is obtained from the orbits of a subgroup of the automorphism group of the underlying graph. We show that when the underlying block graph is a one-clique-sum of complete graphs, the Zariski closure of the set of concentration matrices of an RCOP model on this graph is a toric variety. We also give a Markov basis for the vanishing ideal of this variety in these cases. Finally, we present preliminary results on the ideals of RCOP graphs which are not block graphs.