On low rank graph isomorphism
There is such a c if and only if GI "can be tested to be in polynomial time",

since one can pad with nc isolated vertices.

I don't know of any results on random self reducibility of GI.