首页 | 本学科首页   官方微博 | 高级检索  
     

Circulant Double Coverings of a Circulant Graph of Valency Five
引用本文:Rong Quan FENG Jin Ho KWAK. Circulant Double Coverings of a Circulant Graph of Valency Five[J]. 数学学报(英文版), 2007, 23(1): 23-28. DOI: 10.1007/s10114-005-0773-4
作者姓名:Rong Quan FENG Jin Ho KWAK
作者单位:[1]LMAM, School of Mathematical Sciences, Peking University, Beijing 100871, P. R. China [2]Mathematics, Pohang University of Science and Technology, Pohang, 790-784, Korea
基金项目:The first author is supported by NSF of China (No. 60473019 and 111571005) and by NKBRPC(2004CB318000), and the second author is supported by Com^2MaC-K0SEF in Korea
摘    要:Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant. Recently, the authors [Discrete Math., 277, 73-85 (2004)1 enumerated the isomorphism classes of circulant double coverings of a certain type, called a typical covering, and showed that no double covering of a circulant graph of valency three is circulant. Also, in [Graphs and Combinatorics, 21,386 400 (2005)], the isomorphism classes of circulant double coverings of a circulant graph of valency four are enumerated. In this paper, the isomorphism classes of circulant double coverings of a circulant graph of valency five are enumerated.

关 键 词:图覆盖 电压分配 循环行列式图 五化合价
修稿时间:2004-02-022005-05-31

Circulant Double Coverings of a Circulant Graph of Valency Five
Rong Quan Feng,Jin Ho Kwak. Circulant Double Coverings of a Circulant Graph of Valency Five[J]. Acta Mathematica Sinica(English Series), 2007, 23(1): 23-28. DOI: 10.1007/s10114-005-0773-4
Authors:Rong Quan Feng  Jin Ho Kwak
Affiliation:(1) LMAM, School of Mathematical Sciences, Peking University, Beijing 100871, P. R. China;(2) Mathematics, Pohang University of Science and Technology, Pohang, 790–784, Korea
Abstract:Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant. Recently, the authors [Discrete Math., 277, 73–85 (2004)] enumerated the isomorphism classes of circulant double coverings of a certain type, called a typical covering, and showed that no double covering of a circulant graph of valency three is circulant. Also, in [Graphs and Combinatorics, 21, 386–400 (2005)], the isomorphism classes of circulant double coverings of a circulant graph of valency four are enumerated. In this paper, the isomorphism classes of circulant double coverings of a circulant graph of valency five are enumerated. The first author is supported by NSF of China (No. 60473019 and 10571005) and by NKBRPC (2004CB318000), and the second author is supported by Com2MaC–KOSEF in Korea
Keywords:graph covering   voltage assignment   Cayley   circulant graph
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号