The automorphism group of random graphs with a given number of edges
Published online by Cambridge University Press: 24 October 2008
Extract
An automorphism σ(G) of a graph G is a permutation of the set of its vertices which preserves adjacency. Under the operation of composition the automorphisms of G form a group Aut(G). The graph G is called asymmetric if Aut(G) is trivial, and symmetric otherwise.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 104 , Issue 3 , November 1988 , pp. 441 - 449
- Copyright
- Copyright © Cambridge Philosophical Society 1988
References
REFERENCES
- 8
- Cited by