Pentavalent One-regular Graphs of Square-free Order
Algebra Colloquium · 2010-09 · 17 (03) · 515-524
DOI: 10.1142/s1005386710000490 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebra Colloquium, online erschienen am 03.05.2012. Verfasst von Yantao Li und 1 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 28 Literaturangaben.
Abstract (Originalsprache)
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. Let n be a square-free integer. It is shown in this paper that a pentavalent one-regular graph of order n exists if and only if n = 2 · 5 t p 1 p 2 … p s ≥ 62, where t ≤ 1, s ≥ 1, and p i 's are distinct primes such that 5|(p i -1). For such an integer n, there are exactly 4 s-1 non-isomorphic pentavalent one-regular graphs of order n, which are Cayley graphs on dihedral groups constructed by Kwak et al. This work is a continuation of the classification of cubic one-regular graphs of order twice a square-free integer given by Zhou and Feng.
Zitieren
APA
Li, Y., & Feng, Y. (2010). Pentavalent One-regular Graphs of Square-free Order. Algebra Colloquium, 17(03), 515-524. https://doi.org/10.1142/s1005386710000490
Vancouver
Li Y, Feng Y. Pentavalent One-regular Graphs of Square-free Order. Algebra Colloquium. 2010;17(03):515-524. doi:10.1142/s1005386710000490
BibTeX
@article{Li2010,
author = {Li, Yantao and Feng, Yan-Quan},
title = {Pentavalent One-regular Graphs of Square-free Order},
journal = {Algebra Colloquium},
year = {2010},
volume = {17},
number = {03},
pages = {515--524},
doi = {10.1142/s1005386710000490}
}
EUVIMED