Abstract
It is proved that for isomorphism of n-vertex graphs with weights on the edges there exists a complete system of n2+1 polynomial invariants. It is also shown that isomorphism of graphs reduces in polynomial time to the factorization of a polynomial in one variable into factors irreducible over some field.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
S. A. Cook, “The complexity of theorem-proving procedure,” in: Proc. 3rd Ann. ACM Symp. Theory Comput., Shaker Heights, Ohio (1971), pp. 151–159
G. L. Miller, “Graph isomorphism, general remarks,” Tech. Report 18, University of Rochester (1977).
R. C. Read and D. G. Cornell, “Graph isomorphism disease,” J. Graph Theory,1, 339–363 (1977).
L. Babai, “On the isomorphism problem,” in: Proc. 1977 Comput. Theory Conf., Poznan-Kornik, Poland (1977).
D. Knuth, The Art of Computer Programming, Vol. 2, Mass. (1969).
N. Bourbaki, Algebre Commutative, Paris (1965).
B. L. van der Waerden, Algebra I, New York (1971).
I. R. Shafarevich, Foundations of Algebraic Geometry [in Russian], Moscow (1972).
A. I. Kostrikin, Introduction to Algebra [in Russian], Moscow (1977).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 56–61, 1979.
The author thanks B. S. Stechkin for helpful conversations on isomorphism of graphs.
Rights and permissions
About this article
Cite this article
Grigor'ev, D.Y. Two reductions of graph isomorphism to problems on polynomials. J Math Sci 20, 2296–2298 (1982). https://doi.org/10.1007/BF01629437
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01629437