Large sets of pseudosimilar vertices (Q1923491)

Two vertices in a graph \(G\) are said to be similar if there is an automorphism \(\alpha\) of \(G\) such that \(\alpha(u)=v\); \(u\), \(v\) are removal-similar if \(G-u\simeq G-v\), and pseudosimilar if they are removal-similar but not similar. This paper looks at some of the methods which have been employed to construct graphs with large sets of pseudosimilar vertices or edges.