The isomorphism problem for Cayley graphs has been extensively investigated over the past 30 years. Recently, substantial progress has been made on the study of this problem, many long-standing open problems have been solved, and many new research problems have arisen. The results obtained, and methods developed in this area have also effectively been used to solve other problems regarding finite vertex-transitive graphs. The methods used in this area range from deep group theory, including the finite simple group classification, through to combinatorial techniques. This article is devoted to surveying results, open problems and methods in this area. (C) 2002 Elsevier Science B.V. All rights reserved.
机构:
Shanghai Lixin Univ Accounting & Finance, Sch Math & Stat, Shanghai 201209, Peoples R China
Cent South Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R ChinaShanghai Lixin Univ Accounting & Finance, Sch Math & Stat, Shanghai 201209, Peoples R China
Yang, Xu
Liu, Weijun
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R ChinaShanghai Lixin Univ Accounting & Finance, Sch Math & Stat, Shanghai 201209, Peoples R China
Liu, Weijun
Feng, Lihua
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R ChinaShanghai Lixin Univ Accounting & Finance, Sch Math & Stat, Shanghai 201209, Peoples R China