Weak metacirculants of odd prime power order

نویسندگان

  • Jin-Xin Zhou
  • Sanming Zhou
چکیده

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This paper is devoted to the study of weak metacirculants with odd prime power order. We first prove that a weak metacirculant of odd prime power order is a metacirculant if and only if it has a vertex-transitive split metacyclic automorphism group. We then prove that for any odd prime p and integer l ≥ 4, there exist weak metacirculants of order p which are Cayley graphs but not Cayley graphs of any metacyclic group; this answers a question in [C. H. Li, S. J. Song and D. J. Wang, A characterization of metacirculants, J. Combin. Theory Ser. A 120 (2013) 39–48]. We construct such graphs explicitly by introducing a construction which is a generalization of generalized Petersen graphs. Finally, we determine all smallest possible metacirculants of odd prime power order which are Cayley graphs but not Cayley graphs of any metacyclic group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition by prime graph of the almost simple group PGL(2, 25)

Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...

متن کامل

Half - Transitive Graphs

We explore the relation between vertexand edge-transitivity and arc-transitivity of various graphs. We exhibit several families of graphs whose vertexand edgetransitivity imply arctransitivity. In particular, we show that any vertexand edgetransitive graph with twice a prime number of vertices is arctransitive by simplifying the proof of a theorem by Cheng and Oxley, in which they classify all ...

متن کامل

Asymptotic automorphism groups of Cayley digraphs and graphs of abelian groups of prime-power order

We show that almost every Cayley graph Γ of an abelian group G of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph Γ of an abelian group G of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of G (that is, GL/Aut(Γ)).

متن کامل

Self-Complementary Vertex-Transitive Graphs

A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...

متن کامل

Maximum sum element orders of all proper subgroups of PGL(2, q)

In this paper we show that if q is a power of a prime p , then the projective special linear group PSL(2, q) and the stabilizer of a point of the projective line have maximum sum element orders among all proper subgroups of projective general linear group PGL(2, q) for q odd and even respectively

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 155  شماره 

صفحات  -

تاریخ انتشار 2018