Friendliness property of the associated adjacency matrices, specified by their spectral properties, is important in deriving a convex relaxation of the (intractable) discrete graph matching problem.