Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-26T20:19:49.194Z Has data issue: false hasContentIssue false
  • English
  • Français

The automorphism group of random graphs with a given number of edges

Published online by Cambridge University Press:  24 October 2008

Tomasz Łuczak
Tomasz Łuczak
Affiliation:
Institute of Mathematics, Adam Mickiewicz University, Poznań, Poland
Get access Rights & Permissions [Opens in a new window]

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Bollobás, B.. Distinguishing vertices of random graphs. Ann. Discrete Math. 13 (1982), 33–50.Google Scholar
[2]Bollobás, B.. Random Graphs (Academic Press. 1985).Google Scholar
[3]Frieze, A. M.. On large matchings and cycles in sparse random graphs. Discrete Math. 59 (1986). 243–256.CrossRefGoogle Scholar
[4]Wright, E. M.. Asymmetric and symmetric graphs. Glasgow Math. J. 15 (1974), 69–73.CrossRefGoogle Scholar