English
Related papers

Related papers: Four-Valent Oriented Graphs of Biquasiprimitive Ty…

200 papers

Let $\mathcal{OG}(4)$ denote the family of all graph-group pairs $(\Gamma, G)$ where $\Gamma$ is finite, 4-valent, connected, and $G$-oriented ($G$-half-arc-transitive). A subfamily of $\mathcal{OG}(4)$ has recently been identified as…

Combinatorics · Mathematics 2024-01-18 Nemanja Poznanovic , Cheryl E. Praeger

The family $\mathcal{OG}(4)$ consisting of graph-group pairs $(\Gamma, G)$, where $\Gamma$ is a finite, connected, 4-valent graph admitting a $G$-vertex-, and $G$-edge-transitive, but not $G$-arc-transitive action, has recently been…

Combinatorics · Mathematics 2024-07-17 Nemanja Poznanovic , Cheryl E. Praeger

We study finite four-valent graphs Gamma admitting an edge-transitive group G of automorphisms such that G determines and preserves an edge-orientation on Gamma, and such that at least one G-normal quotient is a cycle (a quotient modulo the…

Combinatorics · Mathematics 2016-12-20 Jehan A. Al-bar , Ahmad N. Al-kenani , Najat Mohammad Muthana , Cheryl E. Praeger

This paper initiates the investigation of the family of $(G,s)$-geodesic-transitive digraphs with $s\geq 2$. We first give a global analysis by providing a reduction result. Let $\Gamma$ be such a digraph and let $N$ be a normal subgroup of…

Combinatorics · Mathematics 2023-03-15 Wei Jin

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

Group Theory · Mathematics 2024-12-05 Yunsong Gan , Weijun Liu , Binzhou Xia

We analyse the normal quotient structure of several infinite families of finite connected edge-transitive, four-valent oriented graphs. These families were singled out by Marusic and others to illustrate various different internal…

Combinatorics · Mathematics 2016-12-21 Jehan A. Al-bar , Ahmad N. Al-kenani , Najat Mohammad Muthana , Cheryl E. Praeger

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Group Theory · Mathematics 2024-02-12 Antonio Beltrán , María José Felipe , Carmen Melchor

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…

Combinatorics · Mathematics 2017-07-11 Yi Wang , Yan-Quan Feng

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

Combinatorics · Mathematics 2019-06-25 Jiangmin Pan , Junjie Huang , Chao Wang

We study pairs $(\Gamma,G)$, where $\Gamma$ is a 'Buekenhout-Tits' pregeometry with all rank 2 truncations connected, and $G\leqslant\mathrm{Aut} \Gamma$ is transitive on the set of elements of each type. The family of such pairs is closed…

Combinatorics · Mathematics 2010-09-02 Michael Giudici , Cai Heng Li , Geoffrey Pearce , Cheryl E. Praeger

Let $H$ be a normal subgroup of a group $G$. The normal subgroup based power graph $\Gamma_H(G)$ of $G$ is the simple undirected graph with vertex set $V(\Gamma_H(G))= (G\setminus H)\cup \{e\}$ and two distinct vertices $a$ and $b$ are…

Combinatorics · Mathematics 2024-04-08 Parveen , Manisha , Jitender Kumar

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

Group Theory · Mathematics 2020-06-08 Shabnam Rahimi

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Combinatorics · Mathematics 2019-04-03 Wei Jin , Cheryl E. Praeger

A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family…

Group Theory · Mathematics 2023-08-31 Jiangmin Pan , Fu-Gang Yin , Jin-Xin Zhou

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…

Group Theory · Mathematics 2020-02-19 Timothy C. Burness , Michael Giudici

A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…

Group Theory · Mathematics 2017-01-06 Jia-Li Du , Yan-Quan Feng

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Combinatorics · Mathematics 2016-01-29 Carmen Amarra , Michael Giudici , Cheryl E. Praeger

A graph $\Gamma$ is called $(G, s)$-arc-transitive if $G \le \mathrm{Aut}(\Gamma)$ is transitive on the set of vertices of $\Gamma$ and the set of $s$-arcs of $\Gamma$, where for an integer $s \ge 1$ an $s$-arc of $\Gamma$ is a sequence of…

Combinatorics · Mathematics 2021-02-15 Xin Gui Fang , Jie Wang , Sanming Zhou

We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.

Combinatorics · Mathematics 2026-05-28 Shahram Mehry
‹ Prev 1 2 3 10 Next ›