Tetravalent half-arc-transitive graphs of order p4
نویسندگان
چکیده
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Let p and q be primes. It is known that no tetravalent half-arc-transitive graphs of order 2p2 exist and a tetravalent half-arctransitive graph of order 4p must be non-Cayley; such a non-Cayley graph exists if and only if p − 1 is divisible by 8 and it is unique for a given order. Based on the constructions of tetravalent half-arc-transitive graphs given by Marušič (J. Comb. Theory B 73:41–76, 1998), in this paper the connected tetravalent half-arc-transitive graphs of order 2pq are classified for distinct odd primes p and q.
منابع مشابه
Constructing even radius tightly attached half-arc-transitive graphs of valency four
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 calle...
متن کاملTetravalent half-arc-transitive graphs of order a product of three primes
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not arc set. Letn be a product of three primes. The problemon the classification of the tetravalent half-arc-transitive graphs of order n has been considered by Xu (1992), Feng et al. (2007) and Wang and Feng (2010), and it was solved for the cases where n is a prime cube or twice a produ...
متن کاملHexavalent half-arc-transitive graphs of order 4p
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set and edge set, but not arc set. It was shown by [Y.-Q. Feng, K.S. Wang, C.X. Zhou, Tetravalent halftransitive graphs of order 4p, European J. Combin. 28 (2007) 726–733] that all tetravalent half-arc-transitive graphs of order 4p for a prime p are non-Cayley and such graphs exist if andonly if p−1 is divi...
متن کاملTetravalent Arc - Transitive Graphs of Order
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. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.
متن کاملTETRAVALENT ARC - TRANSITIVE GRAPHS OF ORDER 3 p
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. In this article a complete classification of tetravalent s-transitive graphs of order 3p is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008