Constructing even radius tightly attached half-arc-transitive graphs of valency four
SCIE
SCOPUS
- Title
- Constructing even radius tightly attached half-arc-transitive graphs of valency four
- Authors
- Feng, YQ; Kwak, JH; Zhou, CX
- Date Issued
- 2007-12
- Publisher
- SPRINGER
- Abstract
- A finite graph X is half-arc-transitive if its automorphism group is transitive on vertices and edges, but not on arcs. When X is tetravalent, the automorphism group induces an orientation on the edges and a cycle of X is called an alternating cycle if its consecutive edges in the cycle have opposite orientations. All alternating cycles of X have the same length and half of this length is called the radius of X. The graph X is said to be tightly attached if any two adjacent alternating cycles intersect in the same number of vertices equal to the radius of X. Marusic(J. Comb. Theory B, 73, 41-76, 1998) classified odd radius tightly attached tetravalent half-arc-transitive graphs. In this paper, we classify the half-arc-transitive regular coverings of the complete bipartite graph K (4,4) whose covering transformation group is cyclic of prime-power order and whose fibre-preserving group contains a half-arc-transitive subgroup. As a result, two new infinite families of even radius tightly attached tetravalent half-arc-transitive graphs are constructed, introducing the first infinite families of tetravalent half-arc-transitive graphs of 2-power orders.
- Keywords
- graph; half-arc-transitive; tightly attached; covering; VOLTAGE ASSIGNMENTS; VERTEX STABILIZER; INFINITE FAMILY; FINITE GRAPHS; CUBIC GRAPHS; ORDER; COVERINGS; AUTOMORPHISMS; SUBORBITS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/23164
- DOI
- 10.1007/S10801-007-0
- ISSN
- 0925-9899
- Article Type
- Article
- Citation
- JOURNAL OF ALGEBRAIC COMBINATORICS, vol. 26, no. 4, page. 431 - 451, 2007-12
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.