Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-26T10:47:02.910Z Has data issue: false hasContentIssue false
  • English
  • Français

On Kelly's congruence theorem for trees

Published online by Cambridge University Press:  24 October 2008

J. A. Bondy
J. A. Bondy
Affiliation:
Mathematical Institute, Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

A graph G is a pair (V{G), E(G)); V(G) is the set of vertices of G, and E(G) the set of edges of G; E(G) is a subset of the Cartesian product V(G) × V(G) (all pairs (υi, υj) where υi∈ V(G), υj ∈ V(G)). If υ is a vertex of G we shall write υ ∈ G. The graph-theoretic terminology used in this paper is that of Berge (1). We shall consider only graphs which are finite, undirected, and without loops.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 65 , Issue 2 , March 1969 , pp. 387 - 397
Copyright
Copyright © Cambridge Philosophical Society 1969

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)Berge, C.The theory of graphs. (Methuen; London, 1962).Google Scholar
(2)Harary, F. & Palmer, E.The reconstruction of a tree from its maximal subtrees. Canad. J. Math. 18 (1966), 803–810.CrossRefGoogle Scholar
(3)Kelly, P. J.A congruence theorem for trees. Pacific J. Math. 7 (1957), 961–968.CrossRefGoogle Scholar
(4)Kö;nig, D.Theorie der endlichen und unendlichen graphen, p. 65 (Liepzig, 1936, reprinted New York, 1950).Google Scholar
(5)Ulam, S. M.A collection of mathematical problems, p. 29 (Wiley; New York, 1960).Google Scholar