Graph Isomorphism

  • Gabriel Valiente


The concept of graph isomorphism lies (explicitly or implicitly) behind almost any discussion of graphs, to the extent that it can be regarded as the fundamental concept of graph theory. In particular, the automorphism group of a graph provides much information about symmetries in the graph. The related problems of subgraph isomorphism and maximum common subgraph isomorphism generalize pattern matching in strings and trees to graphs, and find application whenever structures described by graphs need to be compared.


Automorphism Group Maximal Clique Molecular Graph Graph Product Isomorphism Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Gabriel Valiente
    • 1
  1. 1.Department of SoftwareTechnical University of CataloniaBarcelonaSpain

Personalised recommendations