Graph Automorphism

Graph Automorphism

Edited by 

List price: US$47.99

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 the edge-vertex connectivity. Formally, an automorphism of a graph G = (V, E) is a permutation of the vertex set V, such that for any edge e = (u, v), (e) = ( (u), (v)) is also an edge. That is, it is a graph isomorphism from G to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs. The composition of two automorphisms is another automorphism, and the set of automorphisms of a given graph, under the composition operation, forms a group, the automorphism group of the graph. In the opposite direction, by Frucht's theorem, all groups can be represented as the automorphism group of a connected graph - indeed, of a cubic graph.
show more

Product details

  • Paperback | 76 pages
  • 152 x 229 x 5mm | 122g
  • Saarbrucken, Germany
  • English
  • black & white illustrations
  • 6136697769
  • 9786136697765