Infinitely many finite one-regular graphs of any even valency
SCIE
SCOPUS
- Title
- Infinitely many finite one-regular graphs of any even valency
- Authors
- Kwak, JH; Oh, JM
- Date Issued
- 2004-01
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Abstract
- A graph is said to be one-regular if its automorphism group acts regularly on the arc set. For any integer kgreater than or equal to2, a construction of an infinite family of one-regular graphs of valency 2k is given. All of them are Cayley graphs on dihedral groups with girth 4 and cyclic vertex stabilizer. (C) 2003 Elsevier Inc. All rights reserved.
- Keywords
- one-regular graph; Cayley graph; dihedral group; MAPS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/18159
- DOI
- 10.1016/S0095-8956(0
- ISSN
- 0095-8956
- Article Type
- Article
- Citation
- JOURNAL OF COMBINATORIAL THEORY SERIES B, vol. 90, no. 1, page. 185 - 191, 2004-01
- 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.