Approximation of automorphisms of the rationals and the random graph

Let G be the group of order-preserving automorphisms of the rationals Q, or the group of colour-preserving automorphisms of the C-coloured random graph R-C. We show that given any non-identity f is an element of G, there exists g is an element of G such that every automorphism in G is the limit of a sequence of automorphisms generated by f and g. Moreover, if, in some sense, f has no finite structure, then g can be chosen with a great deal of flexibility.