Pseudosimilarity

	The (well known) smallest graph with 2 pseudosimilar vertices.
	A graph of order 13 (the minimum possible) with trivial automorphism group and 3 pseudosimilar vertices (in blue).
	Another graph of order 13 with trivial automorphism group and 3 pseudosimilar vertices (this time in green).
	A graph of order 9 with a set of 4 mutually pseudosimilar vertices (in blue) consisting of two similar pairs.