期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2012
卷号：3
期号：6
页码：2014-2017
出版社：Technopark Publications
摘要：In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, information retrieval, social networks, etc. Graph Invariants are used to determine the isomorphism between two graphs. Graph Invariant is only the necessary condition for graph Isomorphism. Most of the researchers believe that isomorphism problem is NP complete problem and the most difficult problem .Graph isomorphism is a NP complete or not is always a hot issue for the researchers to study. In this paper we discuss the graph invariants and graph isomorphism techniques
关键词：Graph Isomorphism; Subgraph Isomorphism; and Graph Invariant
