English
Related papers

Related papers: Automorphisms of strongly regular graphs

200 papers

Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of…

Geometric Topology · Mathematics 2011-11-16 Silvia Benvenuti , Riccardo Piergallini

Let $A$ be an abelian variety over an algebraically closed field. We show that $A$ is the automorphism group scheme of some smooth projective variety if and only if $A$ has only finitely many automorphisms as an algebraic group. This…

Algebraic Geometry · Mathematics 2021-05-24 Jérémy Blanc , Michel Brion

We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying…

Combinatorics · Mathematics 2010-12-27 Mark Pankov

A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…

Combinatorics · Mathematics 2019-10-21 Primoz Potocnik , Micael Toledo

We investigate fixed subgroups of automorphisms of generalised Baumslag-Solitar (GBS) groups. Our main results are for automorphisms leaving a Bass-Serre tree invariant, under the assumption that all edge stabilisers are strictly contained…

Group Theory · Mathematics 2025-10-15 Oli Jones , Alan Logan

In this paper, we consider the automorphisms of fine curve graphs restricted to continuously $k$-differentiable curves. We show that for closed surfaces with genus at least 2, they are induced by homeomorphisms of the surface.

Geometric Topology · Mathematics 2024-10-31 Katherine Williams Booth

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…

Combinatorics · Mathematics 2018-10-23 Joseph Richey , Noah Shutty , Matthew Stover

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

Group Theory · Mathematics 2018-05-25 Gareth A. Jones

We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…

Probability · Mathematics 2023-10-25 Théo Lenoir

We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…

Combinatorics · Mathematics 2014-01-14 Joy Morris , Pablo Spiga , Gabriel Verret

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

Lower bounds for the first and the second eigenvalue of uniform hypergraphs which are regular and linear are obtained. One of these bounds is a generalization of the Alon-Boppana Theorem to hypergraphs.

Combinatorics · Mathematics 2015-12-10 Hong-Hai Li , Bojan Mohar

A map is a 2-cell decomposition of an orientable closed surface. A dessin is a bipartite map with a fixed colouring of vertices. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts transitively on the…

Combinatorics · Mathematics 2015-08-20 Kan Hu , Roman Nedela , Na-Er Wang

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Combinatorics · Mathematics 2009-02-10 László Lovász , Balázs Szegedy

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

For a wide class of groups including polycyclic and finitely generated polynomial growth groups it is proved that the Reidemeister number of an automorphism f is equal to the number of finite-dimensional fixed points of the induced map f^…

Group Theory · Mathematics 2007-05-23 Alexander Fel'shtyn , Evgenij Troitsky

We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…

Group Theory · Mathematics 2024-11-15 T. Anitha , R. Rajkumar

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

Number Theory · Mathematics 2016-04-12 Joao Alberto de Faria , Benjamin Hutz

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

Combinatorics · Mathematics 2007-05-23 Laszlo Lovasz , Balazs Szegedy