Related papers: Upper Bounds on the Automorphism Group of a Graph

This is a brief overview of a few selected chapters on automorphism groups of affine varieties. It includes some open questions.

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

A random graph of free groups contains a surface subgroup

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

A few facts concerning the phrase "the automorphism groups become larger at special points of the moduli of K3 surfaces" are presented. It is also shown that the automorphism groups are of infinite order over a dense subset in any…

The group ring of the automorphism group of a p-group is studied using the automorphism groups of subgroups and quotient groups of P.

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…

We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…

In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the…

The description of the automorphism group of group $<a, b; [a^m,b^n]=1>$ ($m,n>1$) in terms of generators and defining relations is given. This result is applied to prove that any normal automorphism of every such group is inner.

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

We classify the pairs $(X,\pi)$, where $\pi\colon X\to S$ is a $\mathbb{P}^1$-bundle over a non-rational geometrically ruled surface $S$ and $\mathrm{Aut}^\circ(X)$ is relatively maximal, i.e., maximal with respect to the inclusion in the…

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…

Let $G$ be a finite group. We prove a theorem implying that the orders of elements of the holomorph $\operatorname{Hol}(G)$ are bounded from above by $|G|$, and we discuss an application to bounding automorphism orders of finite groups.

The automorphism group of a curve is studied from the viewpoint of the canonical embedding and Petri's theorem. A criterion for identifying the automorphism group as an algebraic subgroup the general linear group is given. Furthermore the…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…