اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn edge-primitive and 2-arc-transitive graphs
81
0
0.0
(
0
)
تأليف
Zaiping Lu
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a complete bipartite graph. We also present two examples of such graphs, which are 3-arc-transitive and have faithful vertex-stabilizers.
قيم البحث
اقرأ أيضاً
This paper begins the classification of all edge-primitive 3-arc-transitive graphs by classifying all such graphs where the automorphism group is an almost simple group with socle an alternating or sporadic group, and all such graphs where the automo
rphism group is an almost simple classical group with a vertex-stabiliser acting faithfully on the set of neighbours.
A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, local quasi-primitivity and prime out-valency, imply that an arc-transitiv
e digraph must be highly-arc-transitive. These are then applied to give a complete classification of two-ended highly-arc-transitive digraphs with prime in- and out-valencies.
A graph is edge-primitive if its automorphism group acts primitively on the edge set, and 2-arc-transitive if its automorphism group acts transitively on the set of 2-arcs. In this paper, we present a classification for those edge-primitive graphs wh
ich are 2-arc-transitive and have soluble edge-stabilizers.
A graph $G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {em bi-Cayley graph/} over $H$. Such a graph $G$ is called {em normal/} if $H$ is normal in the full automorphism group of $G
$, and {em normal edge-transitive/} if the normaliser of $H$ in the full automorphism group of $G$ is transitive on the edges of $G$. % In this paper, we give a characterisation of normal edge-transitive bi-Cayley graphs, %which form an important subfamily of bi-Cayley graphs, and in particular, we give a detailed description of $2$-arc-transitive normal bi-Cayley graphs. Using this, we investigate three classes of bi-Cayley graphs, namely those over abelian groups, dihedral groups and metacyclic $p$-groups. We find that under certain conditions, `normal edge-transitive is the same as `normal for graphs in these three classes. As a by-product, we obtain a complete classification of all connected trivalent edge-transitive graphs of girth at most $6$, and answer some open questions from the literature about $2$-arc-transitive, half-arc-transitive and semisymmetric graphs.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
