A fractional automorphism of a graph is a doubly stochastic matrix which commutes with the adjacency matrix of the graph. If we apply an ordinary automorphism to a set of vertices with a particular property, such as being independent or dominating, the resulting set retains that property. We examine the circumstances under which fractional automorphisms preserve the fractional properties of functions on the vertex set.