Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-28T14:21:53.585Z Has data issue: false hasContentIssue false
  • English
  • Français

Homogeneous graphs and stability

Published online by Cambridge University Press:  09 April 2009

A. Gardiner
A. Gardiner
Affiliation:
Pure Mathematics, University of Birmingham, Birmingham B15 2TT, England.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let Γ be a graph with finite vertex set V. Γ is homogeneous if whenever U1, U2 ⊆ V are such that the vertex subgraphs (U1), (U2) are isomorphic, then every isomorphism from (U1) to (U2) extends to an automorphism of Γ; homogeneous graphs were studied by Sheehan (1974) and were classified by the author. Γ is locally homogeneous if whenever U ⊆ V, then every automorphism of (U) extends to an automorphism of Γ. We prove that every locally homogeneous graph is homogeneous.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 21 , Issue 3 , May 1976 , pp. 371 - 375
Copyright
Copyright © Australian Mathematical Society 1976

References

Gardiner, A. (to appear), ‘Homogeneous graphs’, J. Combinatorial Theory.Google Scholar
Sheehan, J. (1974), ‘Smoothly embeddable subgraphs’, J. London Math. Soc. (2), 9, 212–218.CrossRefGoogle Scholar
Wilson, R. J. (1972), Introduction to graph theory (Oliver and Boyd, Edinburgh).Google Scholar
Wielandt, H. (1964), Finite permutation groups (Academic Press, New York).Google Scholar
Yap, H. P. (1974), ‘Some remarks on stable graphs’, Bull. Austral. Math. Soc. 10, 351–357.CrossRefGoogle Scholar