Two-geodesic transitive graphs of prime power order

نویسنده

  • W. Jin School of Statistics‎, ‎Jiangxi University of Finance and Economics‎, ‎Nanchang‎, ‎Jiangxi‎, ‎330013‎, ‎P.R‎. ‎China | Research Center of Applied Statistics‎, ‎Jiangxi University of Finance and Economics‎, ‎Nanchang‎, ‎Jiangxi‎, ‎330013‎, ‎P.R‎. ‎China.
چکیده مقاله:

In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be   $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power order. Next, we classify such graphs which are also vertex quasiprimitive.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

FINITE s-ARC TRANSITIVE GRAPHS OF PRIME-POWER ORDER

An s-arc in a graph is a vertex sequence (α0, α1, . . . , αs) such that {αi−1, αi} ∈ EΓ for 1 6 i 6 s and αi−1 6= αi+1 for 1 6 i 6 s− 1. This paper gives a characterization of a class of s-transitive graphs; that is, graphs for which the automorphism group is transitive on s-arcs but not on (s+ 1)-arcs. It is proved that if Γ is a finite connected s-transitive graph (where s > 2) of order a p-p...

متن کامل

Half-Transitive Graphs of Prime-Cube Order

We call an undirected graph X half-transitive if the automorphism group Aut X of X acts transitively on the vertex set and edge set but not on the set of ordered pairs of adjacent vertices of X. In this paper we determine all half-transitive graphs of order p3 and degree 4, where p is an odd prime; namely, we prove that all such graphs are Cayley graphs on the non-Abelian group of order p3 and ...

متن کامل

Vertex-Transitive Graphs Of Prime-Squared Order Are Hamilton-Decomposable

We prove that all connected vertex-transitive graphs of order p, p a prime, can be decomposed into Hamilton cycles.

متن کامل

Normal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number

In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.

متن کامل

Integral circulant graphs of prime power order with maximal energy

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b ∈ Zn, gcd(a− b, n) ∈ D}. Using tools from convex optimization, we study the maxim...

متن کامل

Integral Circulant Ramanujan Graphs of Prime Power Order

A connected ρ-regular graph G has largest eigenvalue ρ in modulus. G is called Ramanujan if it has at least 3 vertices and the second largest modulus of its eigenvalues is at most 2 √ ρ− 1. In 2010 Droll classified all Ramanujan unitary Cayley graphs. These graphs of type ICG(n, {1}) form a subset of the class of integral circulant graphs ICG(n,D), which can be characterised by their order n an...

متن کامل

منابع من

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

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 43  شماره 6

صفحات  1645- 1655

تاریخ انتشار 2017-11-30

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023