图的自同构群的上界
Upper Bounds on the Automorphism Group of a Graph
摘要：
给出了单图的自同构群阶的上界
英文摘要：
We give upper bounds on the order of the automorphism group of a simple graph
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Upper bounds of orders of automorphism groups of leafless metric graphs
We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give all metric graphs which have the maximum numbers of automorphisms. The proof is written in terms of graph theory.
math.CO
具有$2^n+6$顶点和$2^n$阶循环自同构群的图
Graphs with $2^n+6$ vertices and cyclic automorphism group of order $2^n$
在循环$2$ -群的情况下，研究了具有给定自同构群的图的最小顶点数的上界问题。证明了对任意自然的$n\ge 2$，存在一个无向图，它的顶点为$2^n+6$，自同构群为循环的$2^n$ .这证实了其他作者所声称的最小顶点数的无向图的自同构群$\mathbb{Z}/2^n\mathbb{Z}$的上限。
math.CO
Automorphisms of (Affine) SL(2,q)-Unitals
$\operatorname{SL}(2,q)$-unitals are unitals of order $q$ admitting a regular action of $\operatorname{SL}(2,q)$ on the complement of some block. They can be obtained from affine $\operatorname{SL}(2,q)$-unitals via parallelisms. We compute a sharp upper bound for automorphism groups of affine $\operatorname{SL}(2,q)$-unitals and show that exactly two parallelisms are fixed by all automorphisms. In $\operatorname{SL}(2,q)$-unitals obtained as closures of affine $\operatorname{SL}(2,q)$-unitals via those two parallelisms, we show that there is one block fixed under the full automorphism group.
math.CO
迈向自同构猜想 I：组合控制
Towards the Automorphism Conjecture I: Combinatorial Control
本文利用有序集轨道邻接性与有限单群分类推论，在多数情况下对自同构数量给出指数界限，并指出阻碍该界限的结构，为解决自同构猜想迈出第一步。
math.CO
具有最多自同构的三次图
Cubic graphs with most automorphisms
给出了顶点数给定的三次单图的自同构群的一个精确界。对于每一个顶点数，我们给出了一个达到该界的显式图，并证明了它在特殊情况下的唯一性。
math.CO
On automorphisms and fixing number of co-normal product of graphs
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph $G_1\ast G_2$ of two simple graphs $G_1$ and $G_2$ and give sharp bounds on the order of its automorphism group. We study the fixing number of $G_1\ast G_2$ and prove sharp bounds on it. Moreover, we compute the fixing number of the co-normal product of some families of graphs.
math.CO
更多相关论文收起更多论文
Automorphism groups of finite posets II
We prove that every finite group $G$ can be realized as the automorphism group of a poset with $4|G|$ points. We also provide bounds for the minimum number of points of a poset with cyclic automorphism group of a given prime power order.
math.CO
On the prime spectrum of an automorphism group of an ${\rm AT4}(p,p+2,r)$-graph
This paper is devoted to the problem of classification of ${\rm AT4}(p,p+2,r)$-graphs. There is a unique ${\rm AT4}(p,p+2,r)$-graph with $p=2$, namely, the distance-transitive Soicher graph with intersection array $\{56, 45, 16, 1;1, 8, 45, 56\}$, whose local graphs are isomorphic to the Gewirtz graph. It is still unknown whether an ${\rm AT4}(p,p+2,r)$-graph with $p>2$ exists. The local graphs of each ${\rm AT4}(p,p+2,r)$-graph are strongly regular with parameters $((p+2)(p^2+4p+2),p(p+3),p-2,p)$. In the present paper, we find an upper bound for the prime spectrum of an automorphism group of …
math.CO
On the number of fixed points of automorphisms of vertex-transitive graphs of bounded valency
The main result of this paper is that, if $Γ$ is a finite connected $4$-valent arc-transitive graph, then either $Γ$ is part of a well-understood family of graphs, or every non-identity automorphism of $Γ$ fixes at most $1/3$ of the vertices. As a corollary, we get a similar result for $3$-valent vertex-transitive graphs. Based on these results we propose a conjecture on the number of fixed points of non-identity automorphisms of vertex-transitive graphs of bounded valency.
math.COmath.GR
有界哈德维格数图的图自同构群
Automorphism groups of graphs of bounded Hadwiger number
本文研究有界哈德维格数有限图的自同构群结构，通过分析边传递图证明非阿贝尔合成因子阶有界，并表明这类自同构群可由阿贝尔群、对称群和有界阶群反复扩张得到。
cs.DMmath.COmath.GR
Levenshtein Graphs: Resolvability, Automorphisms & Determining Sets
We introduce the notion of Levenshtein graphs, an analog to Hamming graphs but using the edit distance instead of the Hamming distance; in particular, Levenshtein graphs allow for underlying strings (nodes) of different lengths. We characterize various properties of these graphs, including a necessary and sufficient condition for their geodesic distance to be identical to the edit distance, their automorphism group and determining number, and an upper bound on their metric dimension. Regarding the latter, we construct a resolving set composed of two-run strings and an algorithm that computes t…
cs.DMcs.DSmath.CO
树的自同构的有界单群
Boundedly simple groups of automorphisms of trees
一个群是有界单的，如果对于某个常数N，每个非平凡共轭类在N步中生成整个群。对于一个大类的树，山茨证明了简单的一个典型的子群的自同构群，这是产生的逐点稳定的边缘。我们证明了只有双正则树的均匀剖分是有界单的。实际上，这些群是8-有界简单群。因此，我们证明了：如果G是有界单的（或来自某个类K），且G通过自同构作用在一棵树上，则G固定A的某个顶点，或稳定A的某个端点，或A的最小非空G-不变子树是一棵双正则树的一致剖分.
math.COmath.GRmath.LO
On orders of automorphisms of vertex-transitive graphs
In this paper we investigate orders, longest cycles and the number of cycles of automorphisms of finite vertex-transitive graphs. In particular, we show that the order of every automorphism of a connected vertex-transitive graph with $n$ vertices and of valence $d$, $d\le 4$, is at most $c_d n$ where $c_3=1$ and $c_4 = 9$. Whether such a constant $c_d$ exists for valencies larger than $4$ remains an unanswered question. Further, we prove that every automorphism $g$ of a finite connected $3$-valent vertex-transitive graph $Γ$, $Γ\not\cong K_{3,3}$, has a regular orbit, that is, an orbit of $\la…
math.COmath.GR
A degree bound for strongly nilpotent polynomial automorphisms
Let $k$ be a field of characteristic zero. Let $F = X + H$ be a polynomial mapping from $k^n \to k^n$, where $X$ is the identity mapping and $H$ has only degree two terms and higher. We say that the Jacobian matrix $JH$ of $H$ is strongly nilpotent with index $p$ if for all $X^{(1)},\ldots,X^{(p)} \in k^n$ we have \begin{align*} JH(X^{(1)})\ldots JH (X^{(p)}) = 0. \end{align*} Every $F$ of this form is a polynomial automorphism, i.e. there is a second polynomial mapping $F^{-1}$ such that $F \circ F^{-1} = F^{-1} \circ F = X$. We prove that the degree of the inverse $F^{-1}$ satisfies \begin{a…
math.AGmath.CO
$16$-vertex graphs with automorphism groups $A_{4}$ and $A_{5}$ from icosahedron
The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected $16$-vertex graphs having automorphism groups $A_{4}$ and $A_{5}$. It improves the Babai's bound for $A_{4}$ and the graphical regular representation bound for $A_{5}$. The graphs are constructed using projectivisation of the vertex-face graph of icosahedron.
math.COmath.GRmath.MG
