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.
KeywordsAutomorphism Group Maximal Clique Molecular Graph Graph Product Isomorphism Problem
Unable to display preview. Download preview PDF.