English
Related papers

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

200 papers

The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…

Group Theory · Mathematics 2025-04-22 Mingzhu Chen , Natalia V. Maslova , Marianna R. Zinov'eva

For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two…

Combinatorics · Mathematics 2020-11-04 Christopher M. van Bommel

To every $Q$-irreducible representation $r$ of a finite group $H$, there corresponds a simple factor $A$ of $Q[H]$ with an involution $\tau$. To this pair $(A,\tau)$, we associate an arithmetic group $\Omega$ consisting of all $(2g-2)\times…

Geometric Topology · Mathematics 2015-04-10 Fritz Grunewald , Michael Larsen , Alexander Lubotzky , Justin Malestein

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

Group Theory · Mathematics 2016-06-06 R. Rajkumar , P. Devi , Andrei Gagarin

We consider latin square graphs $\Gamma = \rm{LSG}(H)$ of the Cayley table of a given finite group $H$. We characterize all pairs $(\Gamma,G)$, where $G$ is a subgroup of autoparatopisms of the Cayley table of $H$ such that $G$ acts…

Combinatorics · Mathematics 2017-09-19 Carmen Amarra

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

Combinatorics · Mathematics 2013-09-25 Gareth A. Jones

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

We introduce the notion of continuous orbit equivalence for partial dynamical systems, and give an equivalent characterization in terms of Cartan-isomorphisms for partial C*-crossed products. Both graph C*-algebras and semigroup C*-algebras…

Operator Algebras · Mathematics 2016-03-31 Xin Li

Let $\Gamma$ be a simplicial, finite, connected graph such that $\Gamma$ does not decompose as a nontrivial join. We prove that two notions of strong quasiconvexity and stability are equivalent in the right-angled Artin group $A_\Gamma$…

Group Theory · Mathematics 2017-09-05 Hung Cong Tran

Let $G$ be a simple undirected graph, and $G^\sigma$ be an oriented graph of $G$ with the orientation $\sigma$ and skew-adjacency matrix $S(G^\sigma)$. The skew energy of the oriented graph $G^\sigma$, denoted by $\mathcal{E}_S(G^\sigma)$,…

Combinatorics · Mathematics 2013-04-04 Xiaolin Chen , Xueliang Li , Huishu Lian

For an integer $s\geq1$ and a graph $\Gamma$, a path $(u_0, u_1, \ldots, u_{s})$ of vertices of $\Gamma$ is called an {\em $s$-geodesic} if it is a shortest path from $u_0$ to $u_{s}$. We say that $\Gamma$ is {\em $s$-geodesic transitive}…

Combinatorics · Mathematics 2025-08-20 Jun-Jie Huang

Let $G$ be a finite group and $S$ be a subset of $G.$ A bi-Cayley graph $\BCay(G,S)$ is a simple and an undirected graph with vertex-set $G\times\{1,2\}$ and edge-set $\{\{(g,1),(sg,2)\}\mid g\in G, s\in S\}$. A bi-Cayley graph $\BCay(G,S)$…

Group Theory · Mathematics 2020-03-17 Asieh Sattari , Majid Arezoomand , Mohammad A. Iranmanesh

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

Combinatorics · Mathematics 2023-03-02 Daniel R. Hawtin , Jin-Xin Zhou , Cheryl E. Praeger

Let $G$ be a permutation group on a set $\Omega$. A base for $G$ is a subset of $\Omega$ whose pointwise stabiliser is trivial, and the base size of $G$ is the minimal cardinality of a base. If $G$ has base size $2$, then the corresponding…

Group Theory · Mathematics 2021-10-04 Melissa Lee , Tomasz Popiel

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

Group Theory · Mathematics 2011-03-30 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

Let ${\cal K}_1(G)$ denote the inverse subsemigroup of ${\cal K}(G)$ consisting of all right cosets of all non-trivial subgroups of $G$. This paper concentrates on the study of the group $\Sigma({\cal K}_1(G))$ of all units of the…

Group Theory · Mathematics 2024-12-30 Xian-zhong Zhao , Zi-dong Gao , Dong-lin Lei

Let $G$ be a transitive permutation group on a set $\Omega$, and suppose $G_{\alpha}\cap G_{\beta}=1$ for some distinct $\alpha, \beta\in\Omega$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$,…

Group Theory · Mathematics 2026-02-12 Huye Chen , Shaofei Du , Weicong Li

Let $V$ be a finite-dimensional vector space over a finite field, and suppose $G \leq \Gamma \mathrm{L}(V)$ is a group with a unique subnormal quasisimple subgroup $E(G)$ that is absolutely irreducible on $V$. A base for $G$ is a set of…

Representation Theory · Mathematics 2020-06-29 Melissa Lee

A base for a finite permutation group $G \le \mathrm{Sym}(\Omega)$ is a subset of $\Omega$ with trivial pointwise stabiliser in $G$, and the base size of $G$ is the smallest size of a base for $G$. Motivated by the interest in groups of…

Group Theory · Mathematics 2026-01-30 Saul D. Freedman , Hong Yi Huang , Melissa Lee , Kamilla Rekvényi

A simple graph $G$ is \textit{k-ordered} (respectively, \textit{k-ordered hamiltonian}), if for any sequence of $k$ distinct vertices $v_1, ..., v_k$ of $G$ there exists a cycle (respectively, hamiltonian cycle) in $G$ containing these $k$…

Combinatorics · Mathematics 2007-05-23 Karola Meszaros