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)

Related topics

Related topics

35 relations
2-satisfiability6-j symbolBipartite double coverComputational complexity theory

Broader (1)

Algebraic graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
THE AUTOMORPHISM GROUPS OF QUASI-GALOIS CLOSED ARITHMETIC SCHEMES
  • F. An
  • 2009
  • Corpus ID: 17297966
Assume that X and Y are arithmetic schemes, i.e., integral schemes of finite types over Spec(Z). Then X is said to be quasi… 
2009
2009
Finite irreflexive homomorphism-homogeneous binary relational systems
A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism… 
2008
2008
Second maximal subgroups of the finite alternating and symmetric groups
A subgroup of a finite group G is said to be second maximal if it is maximal in every maximal subgroup of G that contains it. A… 
Review
2008
Review
2008
On the Families of Complex Lines Sufficient for Holomorphic Continuation of Functions Defined on a Domain Boundary
This paper presents selected results on the study of the onedimensional property of holomorphic continuations of functions… 
1999
1999
The automorphism group of a graph product of groups
A theorem of Karrass, Pietrowski and Solitar on the structure of the automorphism group of an amalgamated free product is… 
1995
1995
Computer Perception of Molecular Symmetry
A computer code and algorithm are developed for the computer perception of molecular symmetry. The code generates and uses the… 
Highly Cited
1988
Highly Cited
1988
Crossed products of continuous-trace *-algebras by smooth actions
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… 
1974
1974
Finite groups with a proper 2-generated core
H. Bender's classification of finite groups with a strongly embedded subgroup is an important tool in the study of finite simple… 
1974
1974
On automorphism groups of Boolean algebras
1965
1965
The Automorphism Group of the Direct Product of Strongly Related Automata
The direct product A X B of two automata A and B has been defined by Rabit~ a~d Scott [1] while the automorphism group of A X B…