English
Related papers

Related papers: The automorphism groups and identification of some…

200 papers

We give upper bounds on the order of the automorphism group of a simple graph

Combinatorics · Mathematics 2007-05-23 Ilia Krasikov , Arie Lev , Bhalchandra D. Thatte

We consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field and its subgraph $\Gamma(n,k)_q$ formed by non-degenerate linear $[n,k]_q$ codes. We assume that $1<k<n-1$. It is…

Combinatorics · Mathematics 2022-09-30 Mark Pankov

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Group Theory · Mathematics 2008-03-17 Andrew J. Duncan , Ilya V. Kazachkov , Vladimir N. Remeslennikov

Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…

Combinatorics · Mathematics 2015-03-25 Sanming Zhou

Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…

Quantum Algebra · Mathematics 2007-05-23 Teodor Banica

We consider the induced subgraph of the corresponding Grassmann graph formed by $q$-ary simplex codes of dimension $2$, $q\ge 5$. This graph contains precisely two types of maximal cliques. If $q=5$, then for any two maximal cliques of the…

Combinatorics · Mathematics 2024-02-09 Mariusz Kwiatkowski , Andrzej Matraś , Mark Pankov , Adam Tyc

Let $\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the finite field ${\mathbb F}_{q}$ consisting of $q$ elements and $1<k<n-1$. Denote by $\Gamma(n,k)_q$ the restriction of…

Combinatorics · Mathematics 2016-03-22 Mariusz Kwiatkowski , Mark Pankov

Paley graphs are Cayley graphs which are circulant and strongly regular. Paley-type graph of order a product of two distinct Pythagorean primes was introduced by Dr Angsuman Das. In this paper, we extend the study of Paley-type graphs to…

Combinatorics · Mathematics 2023-10-09 Sivaranjani A , Radha S

We record for reference a detailed description of the automorphism groups of the groups of order $p^{2} q$, where $p$ and $q$ are distinct primes.

Group Theory · Mathematics 2025-09-12 E. Campedel , A. Caranti , I. Del Corso

Let $\mathcal{X}$ be an algebraic curve of genus $g$ defined over an algebraically closed field $K$ of characteristic $p \geq 0$, and $q$ a prime dividing $|\mbox{Aut}(\mathcal{X})|$. We say that $\mathcal{X}$ is a $q$-curve. Homma proved…

Algebraic Geometry · Mathematics 2020-07-06 Nazar Arakelian , Pietro Speziali

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

Group Theory · Mathematics 2023-03-07 Gareth A. Jones , Martin Mačaj

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…

Group Theory · Mathematics 2018-03-15 Mark W. Bissler , Jacob Laubacher

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

Combinatorics · Mathematics 2023-01-18 Mark Pankov

Let $\Gamma_d(q)$ denote the group whose Cayley graph with respect to a particular generating set is the Diestel-Leader graph $DL_d(q)$, as described by Bartholdi, Neuhauser and Woess. We compute both $Aut(\Gamma_d(q))$ and…

Group Theory · Mathematics 2015-02-03 Melanie Stein , Jennifer Taback , Peter Wong

The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension…

Discrete Mathematics · Computer Science 2019-04-16 Martin Grohe , Sandra Kiefer

In this work we consider the class of Cayley graphs known as generalized Paley graphs (GP-graphs for short) given by $\Gamma(k,q) = Cay(\mathbb{F}_q, \{x^k : x\in \mathbb{F}_q^* \})$, where $\mathbb{F}_q$ is a finite field with $q$…

Combinatorics · Mathematics 2025-04-03 Ricardo A. Podestá , Denis E. Videla

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D$ and valency $k \ge 3$. In [Homotopy in $Q$-polynomial distance-regular graphs, Discrete Math., {\bf 223} (2000), 189-206], H. Lewis showed that the girth of…

Combinatorics · Mathematics 2025-01-27 Štefko Miklavič

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

Group Theory · Mathematics 2025-10-28 Thomas Michael Keller , Zachary Martin , Alexa Renner , Gabriel Roca , Eric Yu

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

Combinatorics · Mathematics 2018-10-16 William M. Kantor

We study the point regular groups of automorphisms of some of the known generalised quadrangles. In particular we determine all point regular groups of automorphisms of the thick classical generalised quadrangles. We also construct point…

Combinatorics · Mathematics 2012-06-26 John Bamberg , Michael Giudici