1. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W.H. Freeman Co., 1979.
2. Schmidt, D.C. and Druffel, L.E., A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices, J. ACM, 1976, vol. 23, no. 3, pp. 433–445.
3. Babai, L., Graph isomorphism in quasipolynomial time, Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, 2016, pp. 684–697.
4. Harary, F., Graph Theory, Addison-Wesley, 1969.
5. German, Y., German, O., and Dunaev, A., An algorithm for establishing graph’s isomorfism, Proc. BSTI, Issue 3, Phys. Math. Inf., 2017, no. 2, pp. 114–117.