Related papers: Automorphism Groups of Geometrically Represented G…
We show that in many cases, the automorphism group of a curve and the permutation automorphism group of a corresponding AG code are the same. This generalizes a result of Wesemeyer beyond the case of planar curves.
The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…
One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…
Given a finite group $G$ and a conjugacy class of involutions $X$ of $G$, we define the commuting involution graph $\mathcal{C}(G,X)$ to be the graph with vertex set $X$ and $x,y \in X$ adjacent if and only if $x \neq y$ and $xy =yx$. In…
This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…
In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum isomorphisms of colored versions of those graphs. We show that…
If $G$ is a free product of finite groups, let $\Sigma Aut_1(G)$ denote all (necessarily symmetric) automorphisms of $G$ that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, {\em…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
In any category with a reasonable notion of cover, each object has a group of scissors automorphisms. We prove that under mild conditions, the homology of this group is independent of the object, and can be expressed in terms of the…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that lie on adjacent edges of G and the central graph C(G) of G is…
Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this…
We study the group of automorphisms of the affine plane preserving some given curve, over any field. The group is proven to be algebraic, except in the case where the curve is a bunch of parallel lines. Moreover, a classification of the…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
In this paper we make a clear relationship between the automorphic representations and the quantization through the Geometric Langlands Correspondence. We observe that the discrete series representation are realized in the sum of…
The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
In this paper, we prove that each automorphism of a surface braid group is induced by a homeomorphism of the underlying surface, provided that this surface is a closed, connected, orientable surface of genus at least 2, and the number of…