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)] 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.
Keywordsgraph covering voltage assignment Cayley circulant graph
MR (2000) Subject Classification05C10 05C30
Unable to display preview. Download preview PDF.
- 2.Park, 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, 1994Google Scholar
- 9.Siagiova, J.: Composition of regular coverings of graphs. J. Electrical Engineering, 50, 75–77 (1999)Google Scholar
- 14.Feng, R., Kwak, J. H.: Circulant double coverings of a circulant graph of valency four. Graphs and Combinatorics, 21, 386–400 (2005)Google Scholar