Hostname: page-component-7479d7b7d-rvbq7 Total loading time: 0 Render date: 2024-07-08T23:45:18.876Z Has data issue: false hasContentIssue false
  • English
  • Français

On the edge-reconstruction of graphs

Published online by Cambridge University Press:  17 April 2009

W. Dörfler
W. Dörfler
Affiliation:
3. Institut für Mathematik, Technische Hochschule, Gußhausstnaße, Wien, Austria.
Rights & Permissions [Opens in a new window]

Extract

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.

A graph X is edge-reconstructible if it is uniquely determined up to isomorphism by the set of graphs X – e obtained by deleting one, edge e. The graphs of a comparatively rich class are shown to be edge-reconstructible. This class contains all non-trivial strong products and certain lexicographic products.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 10 , Issue 1 , February 1974 , pp. 79 - 84
Copyright
Copyright © Australian Mathematical Society 1974

References

[1]Dörfler, W., “Bemerkungen zur Ulam-Vermutung”, Arch. Math. 23 (1972), 442–445.CrossRefGoogle Scholar
[2]Dörfler, W., “Some results on the reconstruction of graphs”, Proc. Coll, infinite and finite sets, 1973 (to appear).Google Scholar
[3]Dörfler, Willibald und Imrich, Wilfred, “Eine Klasse rekonstruierbarer Graphen”, Glasnik Mat. Ser. III 7 (1972), 159–165.Google Scholar
[4]Greenwell, D.L. and Hemminger, R.L., “Reconstructing graphs”, The many facets of graph theory, 91–114 (Lecture Notes in Mathematics, 110. Springer-Verlag, Berlin, Heidelberg, New York, 1969).CrossRefGoogle Scholar
[5]Harary, Frank, Graph theory (Addison-Wesley, Reading, Massachussets; London; Ontario; 1969).CrossRefGoogle Scholar
[6]Ulam, S.M., A collection of mathematical problems (Interscience, New York, London, 1960).Google Scholar