Pseudosimilar vertices in a graph

Dissimilar vertices whose removal leaves isomorphic subgraphs are called pseudosimilar. We construct infinite families of graphs having identity automorphism group, yet every vertex is pseudosimilar to some other vertex. Potential impact on the Reconstruction Conjecture is considered. We also construct, for each n, graphs containing a subset of n vertices which are mutually pseudosimilar. the analogous problem for mutually pseudosimilar edges is introduced.