Skip to main content
SpringerLink
Log in

Graph isomorphism and equality of simplices

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

We show that the graph isomorphism problem is equivalent to the problem of recognizing equal simplices in ℝn. This result can lead to new methods in the graph isomorphism problem based on geometrical properties of simplices. In particular, relations between several well-known classes of invariants of graphs and geometrical invariants of simplices are established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich, “The graph isomorphism problem,” in Theory of the Complexity of Computations, Zap. Nauchn. Sem. Leningrad. LOMI (1982), Vol. 118, pp. 83–158 [in Russian].

    MATH  MathSciNet  Google Scholar 

  2. J. Köbler, U. Schöning, and J. Torán, The Graph Isomorphism Problem: Its Stuctural Complexity, in Progr. Theoret. Comput. Sci. (Birkhäuser Boston, Boston, MA, 1993).

    Google Scholar 

  3. D. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs. Theory and Application, in Pure Appl. Math. (Academic Press, New York-London, 1980), Vol. 87.

    Google Scholar 

  4. D. Cvetković, P. Rowlinson, and S. Simić, Eigenspaces of Graphs, in Encyclopedia Math. Appl. (Cambridge Univ. Press, Cambridge, 1997), Vol. 66.

    Google Scholar 

  5. C. R. Johnson and M. Newman, “A note on cospectral graphs,” J. Combin. Theory Ser. B 28(1), 96–103 (1980).

    Article  MATH  MathSciNet  Google Scholar 

  6. F. John, “Extremum problems with inequalities as subsidiary conditions,” in Studies and Essays Presented to R. Courant on his 60th Birthday (Intersci. Publ., New York, 1948), pp. 187–204.

    Google Scholar 

  7. S. P. Tarasov, L. G. Khachiyan, and I. I. Érlikh, “The method of inscribed ellipsoids,” Dokl. Akad. Nauk SSSR 298(5), 1081–1085 (1988) [SovietMath. Dokl. 37 (1), 226–230 (1988)].

    Google Scholar 

  8. C.D. Godsil and B. D. McKay, “Spectral conditions for reconstuctibility of a graph,” J. Combin. Theory Ser. B 30(3), 285–289 (1981).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    V. Yu. Protasov

Authors
  1. V. Yu. Protasov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. Yu. Protasov.

Additional information

Original Russian Text © V. Yu. Protasov, 2009, published in Matematicheskie Zametki, 2009, Vol. 85, No. 5, pp. 758–767.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Protasov, V.Y. Graph isomorphism and equality of simplices. Math Notes 85, 724–732 (2009). https://doi.org/10.1134/S0001434609050137

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434609050137

Key words

Search

Navigation