اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVertex quasiprimitive two-geodesic transitive graphs
76
0
0.0
(
0
)
تأليف
Wei Jin
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For 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 $u eq w$ and $u,w$ are not adjacent. Then $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on both arcs and 2-geodesics. In previous work the author showed that if a $2$-geodesic transitive graph $Gamma$ is locally disconnected and its automorphism group $Aut(Gamma)$ has a non-trivial normal subgroup which is intransitive on the vertex set of $Gamma$, then $Gamma$ is a cover of a smaller 2-geodesic transitive graph. Thus the `basic graphs to study are those for which $Aut(Gamma)$ acts quasiprimitively on the vertex set. In this paper, we study 2-geodesic transitive graphs which are locally disconnected and $Aut(Gamma)$ acts quasiprimitively on the vertex set. We first determine all the possible quasiprimitive action types and give examples for them, and then classify the family of $2$-geodesic transitive graphs whose automorphism group is primitive on its vertex set of $PA$ type.
قيم البحث
اقرأ أيضاً
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex transitive graph. A
s an intermediate step, we prove that every countably infinite, connected, vertex transitive graph has a perfect matching. Incidentally, we construct an example of a 2-ended cubic vertex transitive graph which is not a Cayley graph, answering a question of Watkins from 1990.
A graph is said to be {em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic vertex-transitive n
on-Cayley graphs of order $12p$, where $p$ is a prime, is given. As a result, there are $11$ sporadic and one infinite family of such graphs, of which the sporadic ones occur when $p=5$, $7$ or $17$, and the infinite family exists if and only if $pequiv1 (mod 4)$, and in this family there is a unique graph for a given order.
Let $Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $Gamma$. Fix a base vertex $xin X$ and for $0 leq i leq D$ let $E^*_i=E^*_i(x)$ denote the projection matrix to th
e $i$th subconstituent space of $Gamma$ with respect to $x$. The Terwilliger algebra $T(x)$ of $Gamma$ with respect to $x$ is the semisimple subalgebra of $mathrm{Mat}_X(mathbb{C})$ generated by $A, E^*_0, E^*_1, ldots, E^*_D$. Remark that the isomorphism class of $T(x)$ depends on the choice of the base vertex $x$. We say $Gamma$ is pseudo-vertex-transitive whenever for any vertices $x,y in X$, the Terwilliger algebras $T(x)$ and $T(y)$ are isomorphic. In this paper we discuss pseudo-vertex transitivity for distance-regular graphs with diameter $Din {2,3,4}$. In the case of diameter $2$, a strongly regular graph $Gamma$ is thin, and $Gamma$ is pseudo-vertex-transitive if and only if every local graph of $Gamma$ has the same spectrum. In the case of diameter $3$, Taylor graphs are thin and pseudo-vertex-transitive. In the case of diameter $4$, antipodal tight graphs are thin and pseudo-vertex-transitive.
In this paper, we construct an infinite family of normal Cayley graphs, which are $2$-distance-transitive but neither distance-transitive nor $2$-arc-transitive. This answers a question raised by Chen, Jin and Li in 2019 and corrects a claim in a literature given by Pan, Huang and Liu in 2015.
It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an alternating group o
r a symmetric group. This is the second of a series of papers aiming towards a classification of 2-arc-transitive graphs of odd order.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
