Related papers: $10$-vertex graphs with cyclic automorphism group …

Let Ng be the connected closed nonorientable surface of genus g >= 5 and Mod(Ng) denote the mapping class group of Ng. We prove that the outer automorphism group of Mod(Ng) is either trivial or Z if g is odd, and injects into the mapping…

We show that the twisted conjugacy problem is solvable for large-type Artin groups whose outer automorphism group is finite, generated by graph automorphisms and the global inversion. This includes XXXL Artin groups whose defining graph is…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

In the present paper we study the geometry of plane quartics with large automorphism groups. We show results devoted to smooth plane quartics that are invariant under the action of the elementary abelian group of type $[2,2,2]$, and we…

We study the homotopy groups of the geometric fixed points of the real topological cyclic homology of $\mathbb{Z}/4$. We relate these groups to the values of the non-abelian derived functors of the functor $M \mapsto (M…

We study automorphism groups of smooth quintic threefolds. Especially, we describe all the maximal ones with explicit examples of target quintic threefolds. There are exactly $22$ such groups.

The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at 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…

This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.

The Directed Power Graph of a group is a graph whose vertex set is the elements of the group, with an edge from $x$ to $y$ if $y$ is a power of $x$. The \textit{Power Graph} of a group can be obtained from the directed power graph by…

The \emph{power graph} $P(G)$ of a group $G$ is the graph whose vertex set is $G$, with $x$ and $y$ joined if one is a power of the other; the \emph{directed power graph} $\vec{P}(G)$ has the same vertex set, with an arc from $x$ to $y$ if…

We study the groups of biholomorphic and bimeromorphic automorphisms of conic bundles over certain compact complex manifolds of algebraic dimension zero.

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

We construct infinitely many pairwise non-diffeomorphic smooth structures on a definite $4$-manifold with non-cyclic fundamental group $\mathbb{Z}/2\times \mathbb{Z}/2$.

This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

A squaregraph is a plane graph in which each internal face is a $4$-cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semi-strong product of an outerplanar…