Graph Automorphism Group

2016 ◽  
Author(s):  
Vladimir I. Minkin
Keyword(s):  
Automorphism Group ◽  
Graph Automorphism

scholarly journals Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
José Luis López-Presa ◽  
Luis F. Chiroque ◽  
Antonio Fernández Anta
Keyword(s):  
Automorphism Group ◽  
Classical Problem ◽  
Search Tree ◽  
Input Graph ◽  
Graph Automorphism ◽  
Ga Algorithm ◽  
Speed Up ◽  
Graph Families ◽  
The Impact ◽  
Asymptotic Time

Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. Most GA algorithms explore a search tree using the individualization-refinement procedure. Four novel techniques are proposed which increase the performance of any algorithm of this type by reducing the depth of the search tree and by effectively pruning it. We formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of an input graph. Then, we describe how these techniques have been incorporated into the GA algorithm conauto, asconauto-2.03, with at most an additive polynomial increase in its asymptotic time complexity. Using a benchmark of different graph families, we have evaluated the impact of these techniques on the size of the search tree, observing a significant reduction both when they are applied individually and when all of them are applied together. This is also reflected in a reduction of the running time, which is substantial for some graph families. Finally, we have compared the search tree size of conauto-2.03 against those of other popular GA algorithms, observing that, in most cases, conauto explores less nodes than these algorithms.

scholarly journals On the automorphism group of a symplectic half-flat 6-manifold

2019 ◽  
Vol 31 (1) ◽  
pp. 265-273
Author(s):  
Fabio Podestà ◽  
Alberto Raffero
Keyword(s):  
Automorphism Group ◽  
Lie Algebra ◽  
Group Action ◽  
Cohomogeneity One ◽  
Cohomogeneity One Action

Abstract We prove that the automorphism group of a compact 6-manifold M endowed with a symplectic half-flat {\mathrm{SU}(3)} -structure has Abelian Lie algebra with dimension bounded by {\min\{5,b_{1}(M)\}} . Moreover, we study the properties of the automorphism group action and we discuss relevant examples. In particular, we provide new complete examples on {T\mathbb{S}^{3}} which are invariant under a cohomogeneity one action of {\mathrm{SO}(4)} .

scholarly journals ON EDGE-PRIMITIVE GRAPHS WITH SOLUBLE EDGE-STABILIZERS

2021 ◽  
pp. 1-28
Author(s):  
HUA HAN ◽  
HONG CI LIAO ◽  
ZAI PING LU
Keyword(s):  
Automorphism Group

Abstract A graph is edge-primitive if its automorphism group acts primitively on the edge set, and $2$ -arc-transitive if its automorphism group acts transitively on the set of $2$ -arcs. In this paper, we present a classification for those edge-primitive graphs that are $2$ -arc-transitive and have soluble edge-stabilizers.

scholarly journals Affine cones over cubic surfaces are flexible in codimension one

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Alexander Perepechko
Keyword(s):  
Automorphism Group ◽  
Open Subset ◽  
Pezzo Surface ◽  
Ample Divisor ◽  
Transitive Action ◽  
Del Pezzo Surface ◽  
Codimension One ◽  
Cubic Surfaces ◽  
Special Automorphism ◽  
Del Pezzo

AbstractLet Y be a smooth del Pezzo surface of degree 3 polarized by a very ample divisor that is not proportional to the anticanonical one. Then the affine cone over Y is flexible in codimension one. Equivalently, such a cone has an open subset with an infinitely transitive action of the special automorphism group on it.

Automorphism group and representation of a twisted multi-loop algebra

2010 ◽  
Vol 26 (1) ◽  
pp. 143-154 ◽  
Author(s):  
Cui Chen ◽  
Hai Feng Lian ◽  
Shao Bin Tan
Keyword(s):  
Automorphism Group ◽  
Loop Algebra
Sign in / Sign up

Export Citation Format

Share Document