Hostname: page-component-6bb9c88b65-s7dlb Total loading time: 0 Render date: 2025-07-24T04:33:06.589Z Has data issue: false hasContentIssue false
  • English
  • Français

On the reconstruction conjecture for separable graphs

Part of: Graph theory

Published online by Cambridge University Press:  09 April 2009

V. Krishnamoorthy  and
K. R. Parthasarathy
V. Krishnamoorthy
Affiliation:
Faculty of Science, Madras Institute of Technology, Campus, Perarignar Anna University of Technology, Madras-44, India
K. R. Parthasarathy
Affiliation:
Department of Mathematics, Indian Institute of Technology, Madras-36, India
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.

Some sufficient conditions for the reconstructability of separable graphs are given proceeding along the lines suggested by Bondy, Greenwell and Hemminger. It is shown that the structure and automorphism group of a central block plays an important role in the reconstruction.

MSC classification

Secondary: 05C60: Isomorphism problems (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Information

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 30 , Issue 3 , February 1981 , pp. 307 - 320
Copyright
Copyright © Australian Mathematical Society 1981

References

Behzad, M. and Chartrand, G. (1971), Introduction to the theory of graphs (Allyn and Bacon, Boston).Google Scholar
Bondy, J. A. (1969), ‘On Ulam's conjecture for separable graphs’, Pacific J. Math. 31, 281–288.CrossRefGoogle Scholar
Bouwer, I. Z. (1969), ‘Section graphs for finite permutation groups’, The many facets of graph theory, edited by Chartrand, G. and Kapoor, S. F., pp. 55–61, Lecture Notes in Mathematics 110, Springer Verlag, Berlin.CrossRefGoogle Scholar
Bryant, R. M. (1971), ‘On a conjecture concerning the reconstruction of graphs’, J. Combinatorial Theory Ser. B 11, 139–141.CrossRefGoogle Scholar
Greenwell, D. L. and Hemminger, R. L. (1969), ‘Reconstructing graphs’, The many facets of graph theory, edited by Chartrand, G. and Kapoor, S. F., pp. 91–114, Lecture Notes in Mathematics 110, Springer Verlag, Berlin.CrossRefGoogle Scholar
Harary, F. (1969), Graph theory (Addison-Wesley, Reading, Mass.).CrossRefGoogle Scholar
Krishnamoorthy, V. (1976), ‘The reconstruction conjecture and some related problems’ (Ph. D. thesis, I. I. I. Madras).Google Scholar
Krishnamoorthy, V. and Parthasarathy, K. R. (1978), ‘F-sets in graphs’, J. Combinatorial Theory Ser. B 24, 53–60.CrossRefGoogle Scholar
Manvel, B. (1969), ‘Reconstruction of unicyclic graphs’, Proof techniques in graph theory, edited by Harary, F., pp. 103–107 (Academic Press, New York).Google Scholar
Wielandt, H. (1964), Finite permutation groups (Academic Press, New York).Google Scholar