![](/images/graphics-bg.png)
Finite 1-Regular Cayley Graphs of Valency 5
Joint Authors
Zhang, Xiao Jun
Lou, Ben Gong
Li, Jing Jian
Source
International Journal of Combinatorics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-3, 3 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-03-27
Country of Publication
Egypt
No. of Pages
3
Main Subjects
Abstract EN
Let Γ=Cay(G,S) and G≤X≤AutΓ.
We say Γ is (X,1)-regular Cayley graph if X acts regularly on its arcs.
Γ is said to be core-free if G is core-free in some X≤Aut(Cay(G,S)).
In this paper, we prove that if an (X,1)-regular Cayley graph of valency 5 is not normal or binormal, then it is the normal cover of one of two core-free ones up to isomorphism.
In particular, there are no core-free 1-regular Cayley graphs of valency 5.
American Psychological Association (APA)
Li, Jing Jian& Lou, Ben Gong& Zhang, Xiao Jun. 2013. Finite 1-Regular Cayley Graphs of Valency 5. International Journal of Combinatorics،Vol. 2013, no. 2013, pp.1-3.
https://search.emarefa.net/detail/BIM-447658
Modern Language Association (MLA)
Li, Jing Jian…[et al.]. Finite 1-Regular Cayley Graphs of Valency 5. International Journal of Combinatorics No. 2013 (2013), pp.1-3.
https://search.emarefa.net/detail/BIM-447658
American Medical Association (AMA)
Li, Jing Jian& Lou, Ben Gong& Zhang, Xiao Jun. Finite 1-Regular Cayley Graphs of Valency 5. International Journal of Combinatorics. 2013. Vol. 2013, no. 2013, pp.1-3.
https://search.emarefa.net/detail/BIM-447658
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-447658