Let be the set of all simple loopless undirected graphs on vertices. Let be a linear mapping, , such that the dot product dimension of is the same as the dot product dimension of for any . We show that is necessarily a vertex permutation. Similar results are obtained for mappings that preserve sets of graphs with specified dot product dimensions.