期刊文献+

Circulant Double Coverings of a Circulant Graph of Valency Five 被引量:1

Circulant Double Coverings of a Circulant Graph of Valency Five
原文传递
导出
摘要 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. 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.
机构地区 LMAM Mathematics
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2007年第1期23-28,共6页 数学学报(英文版)
基金 NSF of China(No.60473019 and 10571005) NKBRPC(2004CB318000) Com~2MaC-KOSEF in Korea
关键词 graph covering voltage assignment CAYLEY circulant graph graph covering, voltage assignment, Cayley, circulant graph
  • 相关文献

参考文献14

  • 1Bermond, J. C., Comellas, F., Hsu, D. F.: Distributed loop computer networks: a survey. J. Parallel Distrib. Comput., 24, 2-10 (1995)
  • 2Park, J. H., Chwa, K, Y.: Recursive circulant: a new topology for multicomputer networks, Proc. Internat.Symp. Parallel Architectures, Algorithms and Networks (ISPAN'94), IEEE press, New York, 73-80, 1994
  • 3Gross, J. L., Tucker, T. W.: Generating all graph coverings by permutation voltage assignments. Discrete Math., 18, 273-283 (1977)
  • 4Feng, R., Kwak, J. H., Kim, J., Lee, J.: Isomorphism classes of concrete graph coverings. SIAM J. Disc.Math., 11, 265-272 (1998)
  • 5Hofmeister, M.: Isomorphisms and automorphisms of coverings. Discrete Math,, 98 175-183 (1991)
  • 6Hong, S., Kwak, J. H., Lee, J.: Regular graph coverings whose covering transformation groups have the isomorphism extension property. Discrete Math., 148, 85-105 (1996)
  • 7Kwak, J. H,, Chun, J., Lee, J.: Enumeration of regular graph coverings having finite abelian covering transformation groups. SIAM J. Disc. Math., 11, 273-285 (1998)
  • 8Kwak, J. H., Lee, J.: Enumeration of connected graph coverings. J. Graph Theory, 23, 105-109 (1996)
  • 9Siagiova, J.: Composition of regular coverings of graphs. J. Electrical Engineering, 50, 75-77 (1999)
  • 10Siagiova, J.: Composition of regular coverings of graphs and voltage assignments. Australasian J, Combinatorics, 28, 131-136 (2003)

同被引文献15

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部