Back to Search
Start Over
Tetravalent s-Transitive Graphs of Order 4 p.
- Source :
- Graphs & Combinatorics; Jan2013, Vol. 29 Issue 1, p87-97, 11p
- Publication Year :
- 2013
-
Abstract
- Let s be a positive integer. A graph is s -transitive if its automorphism group is transitive on s-arcs but not on ( s + 1)-arcs. Let p be a prime. Zhou (Discrete Math 309:6081-6086, ) classified tetravalent s-transitive graphs of order 4 p. In this article a complete classification of tetravalent s-transitive graphs of order 4 p is given. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 29
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 84364964
- Full Text :
- https://doi.org/10.1007/s00373-011-1093-3