scholarly journals Automorphisms of graphs

2010 ◽  
pp. 137-155 ◽  
Author(s):  
Peter J. Cameron
1973 ◽  
Vol 25 (2) ◽  
pp. 239-251 ◽  
Author(s):  
Pavol Hell ◽  
Jaroslav Nešetřil

A graph X is a set V(X) (the vertices of X) with a system E(X) of 2-element subsets of V(X) (the edges of X). Let X, Y be graphs and f : V(X) → V(Y) a mapping; then/ is called a homomorphism of X into F if [f(x),f(y)] ∈ E(Y) whenever [x,y] ∈ E(X). Endomorphisms, isomorphisms and automorphisms are defined in the usual manner.Much work has been done on the subject of representing groups as groups of automorphisms of graphs (i.e., given a group G, to find a graph X such that the group of automorphisms of X is isomorphic to G). Recently, this was related to category theory, the main question being as to whether every monoid (i.e., semigroup with 1) can be represented as the monoid of endomorphisms of some graph in a given category of graphs.


1994 ◽  
Vol 72 (5) ◽  
pp. 3341-3343 ◽  
Author(s):  
T. A. Agafonova ◽  
V. F. Gor'kovoi

2008 ◽  
Vol 281 (1) ◽  
pp. 62-74 ◽  
Author(s):  
Bernhard Krön ◽  
Rögnvaldur G. Möller

1973 ◽  
Vol 14 (3) ◽  
pp. 209-215 ◽  
Author(s):  
V Chvátal ◽  
J Sichler

2015 ◽  
Vol 178 (1) ◽  
pp. 171-187 ◽  
Author(s):  
Camille Horbez ◽  
Richard D. Wade

2019 ◽  
Vol 9 (4) ◽  
pp. 2021-2031
Author(s):  
G. Gromadzki ◽  
A. D. Mednykh ◽  
I. A. Mednykh

Sign in / Sign up

Export Citation Format

Share Document