Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-24T13:52:27.629Z Has data issue: false hasContentIssue false
  • English
  • Français

Cubic identity graphs and planar graphs derived from trees

Published online by Cambridge University Press:  09 April 2009

A. T. Balaban ,
Roy O. Davies ,
Frank Harary ,
Anthony Hill  and
Roy Westwick
A. T. Balaban
Affiliation:
Institute of Atomic Physics, Bucharest and International Atomic Energy Agency, Vienna
Roy O. Davies
Affiliation:
Leicester University and University College London
Frank Harary
Affiliation:
Research Center for Group Dynamics University of Michigan, Ann Arbor
Anthony Hill
Affiliation:
Chelsea School of Art, London
Roy Westwick
Affiliation:
University of British Columbia, Vancouver and University of Stockholm
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.

The smallest (nontrivial) identity graph is known to have six points and the smallest identity tree seven. It is now shown that the smallest cubic identity graphs have 12 points and that exactly two of them are planar, namely those constructed by Frucht in his proof that every finite group is isomorphic to the automorphism group of some cubic graph. Both of these graphs can be obtained from plane trees by joining consecutive endpoints; it is shown that when applied to identity trees this construction leads to identity graphs except in certain specified cases. In appendices all connected cubic graphs with 10 points or fewer, and all cubic nonseparable planar graphs with 12 points, are displayed.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 11 , Issue 2 , May 1970 , pp. 207 - 215
Copyright
Copyright © Australian Mathematical Society 1970

References

[1]Balaban, A. T., ‘Valence-isomerism of cyclopolyenes’, Rev. Roumaine Chim. 11 (1966) 1097–1116; erratum 12 (1967), No. 1, 103.Google Scholar
[2]Frucht, R., ‘Herstellung von Graphen mit vorgegebener abstrakten Gruppe’, Compositio Math. 6 (1938) 239–250.Google Scholar
[3]Frucht, R., ‘Graphs of degree three with a given abstract group’, Canad. J. Math. 1 (1949) 365–370.CrossRefGoogle Scholar
[4]Guy, R. K. and Harary, F., ‘On the Möbius ladders’, Canad. Math. Bull. 10 (1967) 493–496.CrossRefGoogle Scholar
[5]Harary, F., Graph Theory (Addison-Wesley, Reading, 1969).CrossRefGoogle Scholar
[6]Harary, F., ‘Combinatorial enumeration problems’, Chap. 1 in Graph Theory and Theoretical Physics (Harary, F., editor), Academic Press. London, 1967, 1–41.Google Scholar
[7]Harary, F. and Palmer, E. M., ‘The smallest graph whose group is cyclic’, Czech. Math. J. 16 (1966) 70–71.CrossRefGoogle Scholar
[8]Harary, F. and Prints, G., ‘The number of homoemorphically irreduible trees, and other species’, Acta Math. 101 (1959) 141–162.CrossRefGoogle Scholar
[9]Harary, F., Prins, G. and Tutte, W. T., ‘The number of plane trees’, Indag. Math. 26 (1964) 319–329.CrossRefGoogle Scholar
[10]Sabidussi, G., ‘Graphs with given group and given graph-theoretical properites’, Canad. J. Math. 9 (1957) 515–525.CrossRefGoogle Scholar
[11]Sabidussi, G., ‘On the minimum order of graphs with given automorphism group’, Monatsh. Math. 63 (1959) 124–127.CrossRefGoogle Scholar