Skip to search formSkip to main contentSkip to account menu

Graph automorphism

Known as: Graph automorphism problem 
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
In this work, all the dessins d’enfants with no more than 4 edges are listed and their Belyi pairs are computed. In order to… 
2006
2006
In spite of its 150 years history, the problem of classifying all finite-dimensional division algebras over a field k is still… 
2004
2004
2004
2004
The automorphism group of a 3-generated 2-group G of intermediate growth is determined and it is shown that the outer group of… 
1998
1998
In this paper, we construct three new extremal lattices of minimum 8; one is 3-modular and of dimension 40, the two others are… 
1993
1993
An extended introduction Some preliminaries concerning interpretations, groups and $\aleph_0$-categoricity A new reconstruction… 
Highly Cited
1988
Highly Cited
1988
We study in detail the structure of C*-crossed products of the form A> G, where A is a continuous-trace algebra and a is an… 
Highly Cited
1952
Highly Cited
1952
Introduction. The outer Galois theory, started by Jacobson [8], has been developed rather thoroughly [2; 3; 6; 12; 16]. The…