Об одном критерии для автоморфизмов графа

The criterion for given bijection defined on vertex set of an arbitrary (not necessarily finite) given graph to be automorphism of this graph is obtained. The criterion can be used for studying as general binary relations as concrete finite graphes. Last case is illustrated on special class of graphes.