Skip to main content
SpringerLink
Log in

Graph algebras and the graph isomorphism problem

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We consider the families of matrix algebras over C associated with graphs. Restricting the multiplicity of the irreducible representations over C produces corresponding classes of graphs. The main result of the paper is a polynomial-time algorithm for recognizing the isomorphism of graphs from these classes. It is a generalization of the well-known Babai-Grigor'ev-Mount algorithm for testing the isomorphism of graphs with bounded eigenvalue multiplicity.

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. Babai, L., Grigor'ev, D. Y., Mount, D. M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proceedings of the 14th ACM STOC, pp. 310–324 (1982)

  2. Babai, L., Kantor, W., Luks, E. M.: Computational complexity and the classification of finite simple groups. In: Proceedings of the 24th Ann. Symp. Found. Comput. Sci. 162–171 (1983)

  3. Curtis, C. W., Reiner, I.: Representation Theory of Finite Groups and Associative Algebras. Interscience, N.Y. 1962

    Google Scholar 

  4. Eberly, W.: Decomposition of algebras over R and C. Comput. Complexity1, 211–234 (1991)

    Google Scholar 

  5. Luks, E. M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci.25, 42–65 (1982)

    Google Scholar 

  6. Mathon, R.: A note on the graph isomorphism counting problem. Inform. Proc. Let.8, 131–132 (1979)

    Google Scholar 

  7. Miller, G. L.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the 12th ACM STOC, pp. 225–235 (1980)

  8. Ponomarenko, I. N.: Cellular Algebras and Graph Isomorphism Problem. Research Report No. 8592-CS, University of Bonn (Apr. 1993)

  9. Ponomarenko, I. N.: The isomorphism problem for classes of graphs. Dokl. Akad. Nauk SSSR304, 552–556 (1989) (Russian); English translation in J. Sov. Math.39, 119–122 (1989)

    Google Scholar 

  10. Read, R. C., Corneil, D. G.: The graph isomorphism disease. J. Graph Theory1, 339–363 (1977)

    Google Scholar 

  11. Weisfeiler, B. Ju., editor: On Construction and Identification of Graphs. Lecture Notes, vol. 558, 1976. Berlin, Heidelberg, New York: Springer 1976

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. POMI, Fontanka 27, 191011, St. Petersburg, Russia

    I. N. Ponomarenko

Authors
  1. I. N. Ponomarenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ponomarenko, I.N. Graph algebras and the graph isomorphism problem. AAECC 5, 277–286 (1994). https://doi.org/10.1007/BF01225642

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01225642

Keywords

Search

Navigation